Further Analysis of an Outcome Set-Based Algorithm for Multiple-Objective Linear Programming

Journal of Optimization Theory and Applications

Volumn 97, Issue 1, 1998, Pages 1-10

  Benson, H P ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

Efficient sets; Multiple objective linear programming; Outer approximation algorithms; Weakly efficient sets

Indexed keywords

APPROXIMATION ALGORITHMS; LINEAR PROGRAMMING;

DECISION AIDS; EFFICIENT POINT; EFFICIENT SETS; EXTREME POINTS; LINEAR PROGRAMMING PROBLEM; MULTIPLE OBJECTIVE LINEAR PROGRAMMING; OUTCOME SETS; OUTER APPROXIMATION ALGORITHM; WEAKLY EFFICIENT SET;

DECISION SUPPORT SYSTEMS;

EID: 0032347070     PISSN: 00223239     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1022614814789     Document Type: Article

References (28)

1. ARMAND, P. Finding All Maximal Efficient Faces in Multiobjective Linear Programming, Mathematical Programming, Vol. 61, pp. 357-375, 1993.
2. ARMAND, P., and MALIVERT, C., Determination of the Efficient Decision Set in Multiobjective Linear Programming, Journal of Optimization Theory and Applications, Vol. 70, pp. 467-489, 1991.
3. BENSON, H. P., Finding an Initial Efficient Extreme Point for a Linear Multiple-Objective Program, Journal of the Operational Research Society, Vol. 32, pp. 495-498, 1981.
4. BENSON, H. P., Generating the Efficient Outcome Set in Multiple-Objective Linear Programs: The Bicriteria Case, Acta Mathematica Vietnamica, Vol. 22, pp. 29-51, 1997.
5. BENSON, H. P., Multiple-Objective Linear Programming with Parameteric Criteria Coefficients, Management Science, Vol. 31, pp. 461-474, 1985.
6. BENSON, H. P., and AKSOY, Y., Using Efficient Feasible Directions in Interactive Multiple-Objective Linear Programming, Operations Research Letters, Vol. 10, pp. 203-209, 1991.
7. COHON, J. L., Multiobjective Programming and Planning, Academic Press, New York, New York, 1978.
8. 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, Vol. 30, pp. 353-381, 1980.
9. ECKER, J. G., and KOUADA, I. A., Finding All Efficient Extreme Points for Multiple-Objective Linear Programs, Mathematical Programming, Vol. 14, pp. 249-261, 1978.
10. EVANS, G. W., An Overview of Techniques for Solving Multiobjective Mathematical Programs, Management Science, Vol. 30, pp. 1268-1282, 1984.
11. EVANS, J. P., and STEUER, R. E., Generating Efficient Extreme Points in Linear Multiple-Objective Programming: Two Algorithms and Computing Experience, Multiple-Criteria Decision Making, Edited by J. L. Cochrane and M. Zeleny, University of South Carolina Press, Columbia, South Carolina, pp. 349-365, 1973.
12. GAL, T., A General Method for Determining the Set of All Efficient Solutions to a Linear Vector Maximum Problem, European Journal of Operational Research, Vol. 1, pp. 307-322, 1977.
13. GOICOECHEA, A., HANSEN, D. R., and DUCKSTEIN, L., Multiobjective Decision Analysis with Engineering and Business Applications, John Wiley and Sons, New York, New York, 1982.
14. LUC, D. T., Theory of Vector Optimization, Springer-Verlag, Berlin, Germany, 1989.
15. PHILIP, J., Algorithms for the Vector Maximization Problem, Mathematical Programming, Vol. 2, pp. 207-229, 1972.
16. SAWARAGI, Y., NAKAYAMA, H., and TANINO, T., Theory of Multiobjective Optimization, Academic Press, Orlando, Florida, 1985.
17. SAYIN, S., An Algorithm Based on Facial Decomposition for Finding the Efficient Set in Multiple-Objective Linear Programming, Operations Research Letters, Vol. 19, pp. 87-94, 1996.
18. STEUER, R. E., A Five-Phase Procedure for Implementing a Vector-Maximum Algorithm for Multiple-Objective Linear Programming Problems, Multiple-Criteria Decision Making: Jouy-en-Josas, France, 1976; Edited by H. Thiriez and S. Zionts, Springer Verlag, New York, New York, 1976.
19. STEUER, R. E., Multiple Criteria Optimization: Theory, Computation, and Application, John Wiley and Sons, New York. New York, 1986.
20. YU, P. L., Multiple-Criteria Decision Making, Plenum, New York, New York, 1985.
21. YU, P. L., and ZELENY, M., The Set of All Nondominated Solutions in Linear Cases and a Multicriteria Simplex Method, Journal of Mathematical Analysis and Applications, Vol. 49, pp. 430-468, 1975.
22. ZELENY, M., Linear Multiobjective Programming, Springer-Verlag, New York, New York, 1974.
23. ZELENY, M., Multiple Criteria Decision Making, McGraw-Hill, New York, New York, 1982.
24. TAMURA, K., and MIURA, S., On Linear Vector Maximization Problems, Journal of the Operations Research Society of Japan, Vol. 20, pp. 139-149, 1977.
25. STRIJBOSCH, L. W. G., VAN DOORNE, A. G. M., and SELEN, W. J., A Simplified MOLP Algorithm: The MOLP-S Procedure, Computers and Operations Research, Vol. 18, pp. 709-716, 1991.
26. BENSON, H. P., An Outer Approximation Algorithm for Generating All Efficient Extreme Points in the Outcome Set of a Multiple Objective Linear Programming Problem, Working Paper, Warrington College of Business Administration, University of Florida, Gainesville, Florida, 1997.
27. ROCKAFELLAR, R. T., Convex Analysis, Princeton University Press, Princeton, New Jersey, 1970.
28. BENSON, H. P., A Geometrical Analysis of the Efficient Outcome Set in Multiple-Objective Convex Programs with Linear Criterion Functions, Journal of Global Optimization, Vol. 6, pp. 231-251, 1995.