A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs
Authors:
- Jerald P. DauerJDJerald P. Dauer
- Richard J. GallagherRGRichard J. Gallagher
Open Access
- 1 January 1996
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 88 (2) , 368-381
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear programEuropean Journal of Operational Research, 1995
- Constructing the set of efficient objective values in linear multiple objective transportation problemsEuropean Journal of Operational Research, 1994
- A representation of the set of feasible objectives in multiple objective linear programsLinear Algebra and its Applications, 1992
- A characterisation of the feasible set of objective function vectors in linear multiple objective problemsEuropean Journal of Operational Research, 1991
- Constructing the set of efficient objective values in multiple objective linear programsEuropean Journal of Operational Research, 1990
- Solving multiple objective linear programs in objective spaceEuropean Journal of Operational Research, 1990
- Analysis of the objective space in multiple objective linear programmingJournal of Mathematical Analysis and Applications, 1987
- The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective ProgramJournal of the Operational Research Society, 1977
- 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