Multiple objective linear programming (MOLP) is almost universally implemented within a simplex algorithm and relies on some of its properties, in particular the use of bases. Alternative linear programming methods such as the projective method need not use bases. Yet, their most common approach to...
Let a polyhedral convex set be given by a finite number of linear inequalities and consider the problem to project this set onto a subspace. This problem, called polyhedral projection problem, is shown to be equivalent to multiple objective linear programming. The number ...
A new approximate algorithm for solving multiple objective linear programming problems with fuzzy parameters. Applied Mathematics and Computation 2006;174:524e44.W. Fengjie, L. Jie and Z. Guangquan, A new approximate algorithm for solving multiple objective linear programming problems with fuzzy ...
This paper describes a solution technique for Linear Programming problems with multiple objective functions. In this type of problem it is often necessary
Solving Fuzzy Linear Programming Problem as Multi Objective Linear Programming Problem This paper proposes the method to the solution of fuzzy linear programming problem with the help of multi objective constrained linear programming problem ... PA Thakre,DS Shelar,SP Thakre - 《Lecture Notes in Engin...
In this paper, we formulate the quadratic assignment problem through multiple objective programming in which we can have several objectives. In the facility layout problem, the objectives can be materials handling cost, production rate, and flexibility. We define efficiency and describe how efficient ...
E. (1982), Linear programming in single- & multiple-objective systems, edited by James P. Ignizio, Prentice-Hall International Series in Industrial and Systems Engineering, Prentice-Hall, Inc., Englewood Cliffs, N.J. 07632, 1982. No. of pages: 506. Price: £22.45. ISBN 0-13-537027-2...
In multiple objective linear programming (MOLP) problems the extraction of all the efficient extreme points becomes problematic as the size of the problem ... R Simons - 《Journal of the Operational Research Society》 被引量: 67发表: 1998年 Solving multiple objective linear programs in objective ...
The approach is based on the decomposition of the feasible set into subsets, referred to as cells, so that the original problem reduces to a series of linear multiple objective programs over the cells. The concepts of cell-e ciency and complex-e ciency are introduced and their relationship ...
Dessouki MI, Ghiassi M and Davis WJ (1979) Determining the worst value of an objective function within the nondominated solutions in multiple objective linear programming. University of Illinois, Urbana. Omega, Vol. 13, No. 6 2. Kok M (1984) The interface with decision makers in interactive...