The Constrained Bottleneck Transportation Problem
نویسندگان
چکیده
منابع مشابه
The Multiobjective Bottleneck Transportation Problem
In this paper we give the solution methods for a multicriterial transportation problem of a nonlinear type. We would like to note that the problems of this type do not have any classical solution algorithms. The article consists of two parts dealing with 2 and 3 objectives respectively, one being non-linear of “bottleneck” type, and the rest being linear ones. Definitions of efficient and extre...
متن کاملA study of the bottleneck single source transportation problem
Given a set of users with known demands, a set of suppliers with known supplies, and known costs of shipping between suppliers and users, the Bottleneck Single Source Transportation is that of assigning the users to the suppliers so that the following conditions are satisfied: (i) the demand of each user is satisfied by a single supplier; (ii) the amount supplied by each supplier does not excee...
متن کاملThe Multi - Criteria Fractional Transportation Problem with Fuzzy " Bottleneck " Condition
The paper proposes a new approach to the multi-criteria fractional transportation problem with the same bottleneck denominators, additionally criterion for is also time constraint, i.e. the type bottleneck. We propose to study the case when the bottleneck criterion is not deterministic, but of fuzzy type. In this paper I propose an iterative algorithm for solving the model. It generates the cro...
متن کاملTime Minimizing Transportation Problem with Fractional Bottleneck Objective Function
This paper is aimed at studying the Time Minimizing Transportation Problem with Fractional Bottleneck Objective Function (TMTP-FBOF). TMTP-FBOF is related to a Lexicographic Fractional Time Minimizing Transportation Problem (LFTMTP), which will be solved by a lexicographic primal code. An algorithm is also developed to determine an initial efficient basic solution to this TMTP-FBOF. The develop...
متن کاملConstrained Matroidal Bottleneck Problems
Algorithms for the constrained bottleneck matroid base problem and the constrained bottleneck independent set problem are presented. The algorithms have improved complexities upon the best known general algorithm. Sufficient conditions are obtained when the proposed algorithms have linear complexity and are therefore the best possible ones. Several specific classes of matroidal problems are con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematics and Statistics
سال: 2007
ISSN: 1549-3644
DOI: 10.3844/jmssp.2007.24.27