A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs

European Journal of Operational Research

Volumn 88, Issue 2, 1996, Pages 368-381

  Dauer, Jerald P ^a   Gallagher, Richard J ^b,c  

^a UNIVERSITY OF TENNESSEE AT CHATTANOOGA   (United States)

^b UNIVERSITY OF MONTANA   (United States)

^c Och Spine at New York Presbyterian Hospitals   (United States)

Author keywords

Multiple criteria linear programming; Objective space analysis

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; LINEAR PROGRAMMING; PROBLEM SOLVING; SET THEORY;

MULTIPLE CRITERIA LINEAR PROGRAMMING; OBJECTIVE SPACE ANALYSIS;

OPERATIONS RESEARCH;

EID: 0029779533     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(94)00199-5     Document Type: Article

References (23)

1. Armand, P., "Finding all maximal efficient faces in multiobjective linear programming", Mathematical Programming 61 (1993) 357-375.
2. Armand, P., and Malivert, C., "Determination of the efficient set in multiobjective linear programming", Journal of Optimization Theory and Applications 70 (1991) 467-489.
3. Dauer, J.P., "Analysis of the objective space in multiple objective linear programming", Journal of Mathematical Analysis and Applications 126 (1987) 579-593.
4. Dauer, J.P., and Liu, Y.-H., "Solving multiple objective linear programs in objective space", European Journal of Operational Research 46 (1990) 350-357.
5. Dauer, J.P., and Saleh, O.A., "A representation of the set of feasible objectives in multiple objective linear programs", Linear Algebra and its Applications 166 (1992) 261-275.
6. Dauer, J.P., and Saleh, O.A., "Constructing the set of efficient objective values in multiple objective linear programs", European Journal of Operational Research 46 (1990) 358-365.
7. Ecker, J.G., Hegner, N.S., and Kouada, I.A., "Generating all maximal efficient faces for multiple objective linear programs", Journal of Optimization Theory and Applications 30 (1980) 353-381.
8. Gal, T., "A general method for determining the set of all efficient solutions to a linear vector maximum problem", European Journal of Operational Research 1 (1977) 307-322.
9. Gallagher, R.J., and Saleh, O.A., "A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program", European Journal of Operational Research 80 (1995) 204-212.
10. Gallagher, R.J., and Saleh, O.A., "Constructing the set of efficient objective values in linear multiple objective transportation problems", European Journal of Operational Research 73 (1994) 150-163.
11. Grünbaum, B., Convex Polytopes, Wiley, New York, 1967.
12. Isermann, H., "The enumeration of the set of all efficient solutions for a linear multiple objective program". Operations Research Quarterly 28 (1977) 711-725.
13. Isermann, H., "Operating manual for the EFFACET Multiple Objective Linear Programming Package", Fakultät für Wirtschaftswissenschaften, Universität Bielefeld, Germany.
14. Karwan, M.H., Lofti, V., Telgen, J., and Zionts, S. (eds.), Redundancy in Mathematical Programming: A State of the Art Survey, Lecture Notes in Economics and Mathematical Systems No. 206, Springer-Verlag, Berlin, 1983.
15. Kok, M., and Roos, C., "On the feasible region in the objective space of a multiple objective linear programming problem", Reports of the Department of Mathematics and Informatics, Delft University of Technology, Delft, Netherlands, 1987.
16. Mangasarian, O.L., Nonlinear Programming, McGraw-Hill, New York, 1969.
17. Padberg, M., and Sung, T.-Y., "An analytical comparison of different formulations of the travelling salesman problem", Mathematical Programming 52 (1991) 315-357.
18. Rockafellar, T.R., Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
19. Schrijver, A., Theory of Linear and Integer Programming, Wiley, New York, 1986.
20. Steuer, R.E., "Manual for the ADBASE Multiple Objective Linear Programming Package", Department of Management Science and Information Technology, University of Georgia, Athens, GA 30602, 1992.
21. Telgen, J., "Redundancy and linear programs", Mathematisch Centrum, Amsterdam, 1981.
22. White, D.J., "A characterisation of the feasible set of objective function vectors in linear multiple objective problems", European Journal of Operational Research 52 (1991) 361-366.
23. Yu, P.L., and Zeleny, M., "The set of all non-dominated solutions in linear cases and a multi-criteria simplex method", Journal of Mathematical Analysis and Applications 49 (1975) 430-468.