Hybrid approach for solving multiple-objective linear programs in outcome space

Journal of Optimization Theory and Applications

Volumn 98, Issue 1, 1998, Pages 17-35

  Benson, H P ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

Efficient set; Global optimization; Multiple objective linear programming; Outcome set; Vector maximization

Indexed keywords

APPROXIMATION ALGORITHMS; LINEAR PROGRAMMING; PROBLEM SOLVING; VECTOR SPACES;

DECISION SPACE; EFFICIENT SETS; GLOBAL OPTIMISATION; HYBRID APPROACH; HYBRID VECTORS; LINEAR PROGRAMMING PROBLEM; MULTIPLE OBJECTIVE LINEAR PROGRAMMING; MULTIPLE OBJECTIVE LINEAR PROGRAMS; OUTCOME SETS; VECTOR MAXIMIZATION;

GLOBAL OPTIMIZATION;

EID: 0032384103     PISSN: 00223239     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1022628612489     Document Type: Article

References (48)

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 Parametric 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., On Efficient Sets in Vector Maximum Problems: A Brief Survey, European Journal of Operational Research, Vol. 24, pp. 253-264, 1986.
13. 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.
14. 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.
15. HEMMING, T., Multiobjective Decision Making under Certainty, Economic Research Institute, Stockholm School of Economics, Stockholm, Sweden, 1978.
16. PHILIP, J., Algorithms for the Vector Maximization Problem, Mathematical Programming, Vol. 2, pp. 207-229, 1972.
17. ROSENTHAL, R. E., Principles of Multiobjective Optimization, Decision Sciences, Vol. 16, pp. 133-152, 1985.
18. SAWARAGI, Y., NAKAYAMA, H., and TANINO, T., Theory of Multiobjective Optimization, Academic Press, Orlando, Florida, 1985.
19. 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.
20. 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, Edited by H. Thiriez and S. Zionts, Springer Verlag, New York, New York, pp. 159-169, 1976.
21. STEUER, R. E., Multiple-Criteria Optimization: Theory, Computation, and Application, John Wiley and Sons, New York, New York, 1986.
22. 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.
23. WHITE, D. J., A Bibliography on the Applications of Mathematical Programming Multiple-Objective Methods, Journal of the Operational Research Society, Vol. 41, pp. 669-691, 1990.
24. Yu, P. L., Multiple-Criteria Decision Making, Plenum, New York, New York, 1985.
25. 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.
26. ZELENY, M., Linear Multiobjective Programming, Springer Verlag, New York, New York, 1974.
27. ZELENY, M., Multiple-Criteria Decision Making, McGraw-Hill, New York, New York, 1982.
28. ISERMANN, H., The Enumeration of the Set of All Efficient Solutions for a Linear Multiple-Objective Program, Operational Research Quarterly, Vol. 28, pp. 711-725, 1977.
29. BENSON, H. P., and SAYIN, S., Towards Finding Global Representations of the Efficient Set in Multiple-Objective Mathematical Programming, Naval Research Logistics, Vol. 44, pp. 47-67, 1997.
30. DAUER, J. P., and LIU, Y. H., Solving Multiple-Objective Linear Programs in Objective Space, European Journal of Operational Research, Vol. 46, pp. 350-357, 1990.
31. DAUER, J. P., and SALEH, O. A., Constructing the Set of Efficient Objective Values in Multiple-Objective Linear Programs, European Journal of Operational Research, Vol. 46, pp. 358-365, 1990.
32. MORSE, J. N., Reducing the Size of the Nondominated Set: Pruning by Clustering, Computers and Operations Research, Vol. 7, pp. 55-66, 1980.
33. STEUER, R. E., Multiple-Objective Linear Programming with Interval Criterion Weights, Management Science, Vol. 23, pp. 305-316, 1976.
34. STEUER, R. E., and HARRIS, F. W., Intra-Set Point Generation and Filtering in Decision and Criterion Space, Computers and Operations Research, Vol. 7, pp. 41-53, 1980.
35. 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.
36. 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, Vol. 80, pp. 204-212, 1995.
37. DAUER, J. P., and GALLAGHER, R. J., A Combined Constraint-Space, Objective-Space Approach for Determining High-Dimensional Maximal Efficient Faces of Multiple-Objective Linear Programs, European Journal of Operational Research, Vol. 88, pp. 368-381, 1996.
38. JAHN, J., On the Determination of Minimal Facets and Edges of a Polyhedral Set, Journal of Multicriteria Decision Analysis (to appear).
39. ARMANN, R., Solving Multiobjective Programming Problems by Discrete Representation, Optimization, Vol. 20, pp. 483-492, 1989.
40. 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.
41. DAUER, J. P., Analysis of the Objective Space in Multiple-Objective Linear Programming, Journal of Mathematical Analysis and Applications, Vol. 126, pp. 579-593, 1987.
42. BAN, V., A Finite Algorithm for Minimizing a Concave Function under Linear Constraints and Its Application, IFIP Working Conference on Recent Advances on System Modeling and Optimization, Hanoi, Vietnam, 1983.
43. TUY, H., and HORST, R., Convergence and Restart in Branch- and-Bound Algorithms for Global Optimization: Application to Concave Minimization and D. C. Optimization Problems, Mathematical Programming, Vol. 41, pp. 161-183, 1988.
44. HORST, R., and TUY, H., Global Optimization: Deterministic Approaches, 2nd Edition, Springer Verlag, Berlin, Germany, 1993.
45. HORST, R., and PARDALOS, P., Editors, Handbook of Global Optimization, Kluwer Academic Publishers, Dordrecht, Holland, 1995.
46. ROCKAFELLAR, R. T., Convex Analysis, Princeton University Press, Princeton, New Jersey, 1970.
47. HORST, R., On the Vertex Enumeration Problem in Cutting-Plane Algorithms of Global Optimization, Operations Research, Edited by G. Fandel and H. Gehring, Springer, Berlin, Germany, pp. 13-22, 1991.
48. HORST, R., and THOAI, N. V., Modification, Implementation, and Comparison of Three Algorithms for Globally Solving Linearly Constrained Convex Minimization Problems, Computing, Vol. 42, pp. 271-289, 1989.