Abstract
Lexicographic max-min (LMM) optimization is of considerable importance in many fairness-oriented applications. LMM problems can be reformulated in a way that allows to solve them by applying the standard lexicographic maximization algorithm. However, the reformulation introduces a large number of auxiliary variables and linear constraints, making the process computationally complex. In this paper, two approximation schemes for such a reformulation are presented, resulting in problem size reduction and significant performance gains. Their influence on the quality of the solution is shown in a series of computational experiments concerned with the fair network dimensioning and bandwidth allocation problem.
Publisher
National Institute of Telecommunications
Reference20 articles.
1. H. Luss, Equitable Resource Allocation: Models, Algorithms, and Applications, Hoboken: John Wiley & Sons, 376 p., 2012.
2. W. Ogryczak, Linear and Discrete Optimization with Multiple Criteria: Preference Models and Applications to Decision Support, Warsaw University Press, 1997 (ISBN: 9788323099413) [in Polish].
3. W. Ogryczak, M. Pióro, and A. Tomaszewski, "Telecommunication Network Design and Max-min Optimization Problem", Journal of Telecommunication and Information Technology, no. 3, pp. 43-56, 2005 (https://jtit.pl/jtit/article/view/326).
4. W. Ogryczak, "On the Lexicographic Minimax Approach to Location Problems", European Journal of Operational Research, vol. 100, no. 3, pp. 566-585, 1997.
5. V.X. Chen and J.N. Hooker, "A Guide to Formulating Fairness in an Optimization Model", Annals of Operations Research, vol. 326, no. 1, pp. 581-619, 2023.