An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
Author:
- 1 August 1996
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 19 (2) , 87-94
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programsEuropean Journal of Operational Research, 1996
- Finding all maximal efficient faces in multiobjective linear programmingMathematical Programming, 1993
- Complete efficiency and the initialization of algorithms for multiple objective programmingOperations Research Letters, 1991
- Determination of the efficient set in multiobjective linear programmingJournal of Optimization Theory and Applications, 1991
- An Overview of Techniques for Solving Multiobjective Mathematical ProgramsManagement Science, 1984
- Generating all maximal efficient faces for multiple objective linear programsJournal of Optimization Theory and Applications, 1980
- Finding all efficient extreme points for multiple objective linear programsMathematical Programming, 1978
- A general method for determining the set of all efficient solutions to a linear vectormaximum problemEuropean Journal of Operational Research, 1977
- The set of all nondominated solutions in linear cases and a multicriteria simplex methodJournal of Mathematical Analysis and Applications, 1975
- A revised simplex method for linear multiple objective programsMathematical Programming, 1973