ICCSA 2006: Computational Science and Its Applications - ICCSA 2006 pp 802-811 | Cite as
On Direct Methods for Lexicographic Min-Max Optimization
Abstract
The approach called the Lexicographic Min-Max (LMM) optimization depends on searching for solutions minimal according to the lex-max order on a multidimensional outcome space. LMM is a refinement of the standard Min-Max optimization, but in the former, in addition to the largest outcome, we minimize also the second largest outcome (provided that the largest one remains as small as possible), minimize the third largest (provided that the two largest remain as small as possible), and so on. The necessity of point-wise ordering of outcomes within the lexicographic optimization scheme causes that the LMM problem is hard to implement. For convex problems it is possible to use iterative algorithms solving a sequence of properly defined Min-Max problems by eliminating some blocked outcomes. In general, it may not exist any blocked outcome thus disabling possibility of iterative Min-Max processing. In this paper we analyze two alternative optimization models allowing to form lexicographic sequential procedures for various nonconvex (possibly discrete) LMM problems. Both the approaches are based on sequential optimization of directly defined artificial criteria. The criteria can be introduced into the original model with some auxiliary variables and linear inequalities thus the methods are easily implementable.
Keywords
Matrix Game Multiple Objective Linear Programming Multiple Criterion Optimization Individual Objective Function Auxiliary ConstraintPreview
Unable to display preview. Download preview PDF.
References
- 1.Behringer, F.A.: A simplex based algorithm for the lexicographically extended linear maxmin problem. Eur. J. Opnl. Res. 7, 274–283 (1981)MATHCrossRefMathSciNetGoogle Scholar
- 2.Bertsekas, D., Gallager, R.: Data Networks. Prentice-Hall, Englewood Cliffs (1987)Google Scholar
- 3.Burkard, R.E., Rendl, F.: Lexicographic bottleneck problems. Oper. Res. Let. 10, 303–308 (1991)MATHCrossRefMathSciNetGoogle Scholar
- 4.Della Croce, F., Paschos, V.T., Tsoukias, A.: An improved general procedure for lexicographic bottleneck problem. Oper. Res. Let. 24, 187–194 (1999)MATHCrossRefGoogle Scholar
- 5.Denda, R., Banchs, A., Effelsberg, W.: The fairness challenge in computer networks. In: Crowcroft, J., Roberts, J., Smirnov, M.I. (eds.) QofIS 2000. LNCS, vol. 1922, pp. 208–220. Springer, Heidelberg (2000)CrossRefGoogle Scholar
- 6.Dresher, M.: Games of Strategy. Prentice-Hall, Englewood Cliffs (1961)MATHGoogle Scholar
- 7.Dubois, D., Fortemps, P., Pirlot, M., Prade, H.: Leximin optimality and fuzzy set-theoretic operations. Eur. J. Opnl. Res. 130, 20–28 (2001)MATHCrossRefMathSciNetGoogle Scholar
- 8.Ehrgott, M.: Discrete decision problems, multiple criteria optimization classes and lexicographic max-ordering. In: Stewart, T.J., van den Honert, R.C. (eds.) Trends in Multicriteria Decision Making, pp. 31–44. Springer, Berlin (1998)Google Scholar
- 9.Klein, R.S., Luss, H., Smith, D.R.: A lexicographic minimax algorithm for multiperiod resource allocation. Math. Progr. 55, 213–234 (1992)MATHCrossRefMathSciNetGoogle Scholar
- 10.Kostreva, M.M., Ogryczak, W.: Linear optimization with multiple equitable criteria. RAIRO Oper. Res. 33, 275–297 (1999)MATHCrossRefMathSciNetGoogle Scholar
- 11.Luss, H.: On equitable resource allocation problems: A lexicographic minimax approach. Oper. Res. 47, 361–378 (1999)MATHCrossRefGoogle Scholar
- 12.Marchi, E., Oviedo, J.A.: Lexicographic optimality in the multiple objective linear programming: the nucleolar solution. Eur. J. Opnl. Res. 57, 355–359 (1992)MATHCrossRefGoogle Scholar
- 13.Ogryczak, W.: Linear and Discrete Optimization with Multiple Criteria: Preference Models and Applications to Decision Support (in Polish). Warsaw Univ. Press, Warsaw (1997)Google Scholar
- 14.Ogryczak, W.: On the lexicographic minimax approach to location problems. Eur. J. Opnl. Res. 100, 566–585 (1997)MATHCrossRefGoogle Scholar
- 15.Ogryczak, W.: Multiple criteria optimization and decisions under risk. Control & Cyber 31, 975–1003 (2002)MATHGoogle Scholar
- 16.Ogryczak, W., Pióro, M., Tomaszewski, A.: Telecommunication network design and max-min optimization problem. J. Telecom. Info. Tech. 3/05, 43–56 (2005)Google Scholar
- 17.Ogryczak, W., Śliwiński, T.: On equitable approaches to resource allocation problems: the conditional minimax solution, J. Telecom. Info. Tech. 3/02, 40–48 (2002)Google Scholar
- 18.Ogryczak, W., Śliwiński, T.: On solving linear programs with the ordered weighted averaging objective. Eur. J. Opnl. Res. 148, 80–91 (2003)MATHCrossRefGoogle Scholar
- 19.Ogryczak, W., Tamir, A.: Minimizing the sum of the k largest functions in linear time. Inform. Proc. Let. 85, 117–122 (2003)MATHCrossRefMathSciNetGoogle Scholar
- 20.Pióro, M., Medhi, D.: Routing, Flow and Capacity Design in Communication and Computer Networks. Morgan Kaufmann, San Francisco (2004)MATHGoogle Scholar
- 21.Potters, J.A.M., Tijs, S.H.: The nucleolus of a matrix game and other nucleoli. Math. of Oper. Res. 17, 164–174 (1992)MATHCrossRefMathSciNetGoogle Scholar
- 22.Rawls, J.: The Theory of Justice. Harvard University Press, Cambridge (1971)Google Scholar
- 23.Rice, J.R.: Tschebyscheff approximation in a compact metric space. Bull. Amer. Math. Soc. 68, 405–410 (1962)MATHCrossRefMathSciNetGoogle Scholar
- 24.Yager, R.R.: On the analytic representation of the Leximin ordering and its application to flexible constraint propagation. Eur. J. Opnl. Res. 102, 176–192 (1997)MATHCrossRefGoogle Scholar