Data networks
A lexicographic minimax algorithm for multiperiod resource allocation
Mathematical Programming: Series A and B
The nucleolus of a matrix game and other nucleoli
Mathematics of Operations Research
Minimizing the sum of the k largest functions in linear time
Information Processing Letters
The Fairness Challenge in Computer Networks
QofIS '00 Proceedings of the First COST 263 International Workshop on Quality of Future Internet Services
On Equitable Resource Allocation Problems: a Lexicographic Minimax Approach
Operations Research
Routing, Flow, and Capacity Design in Communication and Computer Networks
Routing, Flow, and Capacity Design in Communication and Computer Networks
An improved general procedure for lexicographic bottleneck problems
Operations Research Letters
Bicriteria models for fair and efficient resource allocation
SocInfo'10 Proceedings of the Second international conference on Social informatics
| Hi-index | 0.00 |
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.