Duality of nonscalarized multiobjective linear programs: Dual balance, level sets, and dual clusters of optimal vectors

Journal of Optimization Theory and Applications

Volumn 108, Issue 1, 2001, Pages 109-137

  Galperin, E ^a   Jimenez Guerra, P ^b  

^a UNIVERSITÉ DU QUÉBEC À MONTRÉAL   (Canada)

^b UNIVERSIDAD NACIONAL DE EDUCACIÓN A DISTANCIA   (Spain)

Author keywords

Nonscalarized multiobjective programming; Vector optimization

Indexed keywords

COMPUTER PROGRAMMING; LINEAR PROGRAMMING; PARETO PRINCIPLE; VECTORS;

EXPANSION PROCESS; LEVEL SET; LINEAR PROGRAMS; MULTI OBJECTIVE; MULTIOBJECTIVE PROGRAMMING; NONSCALARIZED MULTIOBJECTIVE PROGRAMMING; OPTIMAL SOLUTIONS; SCALARIZATION; SET EXPANSIONS; VECTOR OPTIMIZATIONS;

MULTIOBJECTIVE OPTIMIZATION;

EID: 0035219345     PISSN: 00223239     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1026465906067     Document Type: Article

References (41)

1. 1. GAUVIN, J., A Formula for the Sensitivity Analysis of Linear Programming Problems, 20th Symposium on Mathematical Programming with Data Perturbations, Washington, DC, May 21-22, 1998.
2. 2. ADLER, I., and MONTEIRO, R. D. C., A Geometric View of Parametric Linear Programming, Algorithmica, Vol. 8, pp. 161-176, 1992.
3. 3. PARETO, V., Cours d'Economie Politique, Lausanne Rouge, Lausanne, Switzerland, 1896.
4. 4. CHARNES, A., and COOPER, W. W., Management Models and Industrial Applications of Linear Programming, Wiley, New York, NY, Vol. 1, 1961.
5. 5. GEOFFRION, A. M., Proper Efficiency and Theory of Vector Optimization, Journal of Mathematical Analysis and Applications, Vol. 22, pp. 618-630, 1968.
6. 6. YU, P. L., Cone Convexity, Cone Extreme Points, and Nondominated Solutions in Decision Problems with Multiobjectives, Multicriteria Decision Making and Differential Games, Plenum, New York, NY, 1976.
7. 7. IGNIZIO, J. P., Goal Programming and Extensions, Lexington Books, Lexington, Massachusetts, 1976.
8. 8. KEENEY, R., and RAIFFA, H., Decisions with Multiple Objectives: Preferences and Value Trade-Offs, Wiley, New York, NY, 1976.
9. 9. COCHRANE, J. L., and ZELENY, M., Multiple-Criteria Decision Making, University of South Carolina Press, Columbia, South Carolina, 1973.
10. 10. ECKER, J. G., and KOUADA, I. A., Finding Efficient Points for Linear Multiple Objective Programs, Mathematical Programming, Vol. 8, pp. 375-377, 1975.
11. 11. BEN-ISRAEL, A., BEN-TAL, A., and CHARNES, A., Necessary and Sufficient Conditions for a Pareto Optimum in Convex Programming, Econometrica, Vol. 45, pp. 811-820, 1977.
12. 12. ZELENY, M., Linear Multiobjective Programming, Springer Verlag, Berlin, Germany, 1974.
13. 13. ZELENY, M., Multiple-Criteria Decision Making, McGraw-Hill, New York, NY, 1982.
14. 14. WENDELL, R. E., and LEE, D. N., Efficiency in Multiple-Objective Optimization Problems, Mathematical Programming, Vol. 12, pp. 406-414, 1977.
15. 15. COHON, J. L., Multiobjective Programming and Planning, Academic Press, New York, NY, 1978.
16. 16. 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.
17. 17. GEARHART, W. B., Compromise Solutions and Estimation of the Noninferior Set, Journal of Optimization Theory and Applications, Vol. 28, pp. 29-47, 1979.
18. 18. HWANG, C. L., MASUD, A. S. M., PAIDY, S. R., and YOON, K., Multiple-Objective Decision-Making. Methods and Applications: A State of the Art Survey, Springer Verlag, Berlin, Germany, 1979.
19. 19. STEUER, R. E., and CHOO, E. U., An Interactive Weighted Tchebycheff Procedure for Multiple-Objective Programming, Mathematical Programming, Vol. 26, pp. 309-322, 1983.
20. 20. PASCOLETTI, A., and SERAFINI, P., Scalarizing Vector Optimization Problems, Journal of Optimization Theory and Applications, Vol. 42, pp. 499-524, 1984.
21. 21. WIECEK, M., The Skeleton Method in Multicriteria Problems, Foundations of Control Engineering, Vol. 9, pp. 193-200, 1984.
22. 22. ROY, B., Méthodologie Multicritère d'Aide à la Décision, Economica, Paris, France, 1985.
23. 23. WHITE, D. J., Characterizations of Efficient Sets by Constrained Objectives, Journal of Optimization Theory and Applications, Vol. 45, pp. 603-629, 1985.
24. 24. CHANKONG, V., and HAIMES, Y. Y., Multiobjective Decision Making: Theory and Methodology, North Holland, New York, NY, 1983.
25. 25. Yu, P. L., Multiple-Criteria Decision Making: Concepts, Techniques, and Extensions, Plenum Press, New York, NY, 1985.
26. 26. SAWARAGI, Y., NAKAYAMA, H., and TANINO, T., Theory of Multiobjective Optimization, Academic Press, Orlando, Florida, 1985.
27. 27. STEUER, R. E., Multiple-Criteria Optimization: Theory, Computation, and Applications, John Wiley, New York, NY, 1986.
28. 28. SOLOVEICHIK, D., A New Approach to Decision Making in Multiple-Objective Linear Programming (MOLP) Problems, Annals of the New York Academy of Sciences, Vol. 491, pp. 245-252, 1987.
29. 29. LOOTSMA, F. A., Optimization with Multiple Objectives, Mathematical Programming, Recent Developments and Applications, Edited by M. Iri and K. Tanabe, Kluwer, Dordrecht, Holland, pp. 333-364, 1989.
30. 30. HELBIG, S., An Algorithm for a Vector Optimization Problem over a Disjunctive Feasible Set, Methods of Operations Research, Vol. 60, pp. 397-405, 1990.
31. 31. GALPERIN, E. A., Nonscalarized Multiobjective Global Optimization, Journal of Optimization Theory and Applications, Vol. 75, pp. 69-85, 1992.
32. 32. BALBAS, A., and HERAS, A., Duality Theory for Infinite-Dimensional Multiobjective Programming, European Journal of Operations Research, Vol. 68, pp. 379-388, 1993.
33. 33. VAN ROOYEN, M., ZHOU, X., and ZLOBEC, S. A., A Saddle-Point Characterization of Pareto Optima, Mathematical Programming, Vol. 67, pp. 77-88, 1994.
34. 34. KALISZEWSKI, I., Quantitative Pareto Analysis by Cone Separation Technique, Kluwer Academic Publishers, Boston, Massachusetts, 1994.
35. 35. RUIZ-CANALES, P., and RUFIAN-LIZANA, A., A Characterization of Weakly Efficient Points, Mathematical Programming, Vol. 68, pp. 205-212, 1995.
36. 36. BALBAS, A., and JIMENEZ GUERRA, P., Sensitivity Analysis for Convex Multiobjective Programming in Abstract Spaces, Journal of Mathematical Analysis and Applications, Vol. 202, pp. 645-658, 1996.
37. 37. EHRGOTT, M., HAMACHER, H. W., KLAMROTH, K., NICKEL, S., SCHÖBEL, A., and WIECEK, M. M., A Note on the Equivalence of Balance Points and Pareto Solutions in Multiple-Objective Programming, Journal of Optimization Theory and Applications, Vol. 92, pp. 209-212, 1997.
38. 38. GALPERIN, E. A., Pareto Analysis vis-à-vis the Balance Space Approach in Multiobjective Global Optimization, Journal of Optimization Theory and Applications, Vol. 93, pp. 533-545, 1997.
39. 39. GALPERIN, E. A., and WIECEK, M. M., Retrieval and Use of the Balance Set in Multiobjective Global Optimization, Computers and Mathematics with Applications, Vol. 37, pp. 111-123, 1999.
40. 40. BALBAS, A., JIMENEZ GUERRA, P., and HERAS, A., Duality Theory and Slackness Conditions in Multiobjective Linear Programming, Computers and Mathematics with Applications, Vol. 37, pp. 101-109, 1999.
41. 41. GALPERIN, E. A., The Cubic Algorithm for Optimization and Control, NP Research Publication, Montreal, Canada, 1990.