|
This article is cited in 24 scientific papers (total in 24 papers)
A general approach to studying the stability of a Pareto optimal solution of a vector integer linear programming problem
V. A. Emelichev, K. G. Kuz'min
Abstract:
We consider a multicriteria integer linear programming problem with a finite set of admissible solutions. With the use of Minkowski–Mahler inequality, we obtain a bound for the domain in the space of parameters of the problem equipped with some norm where the Pareto optimality of the solution is still retained. In the case of a monotone norm, we give a formula for the stability radius of the solution. As a corollary we obtain the formula for the stability radius in the case of the Hölder norm and, in particular, the Chebyshev norm in the space of parameters of a vector criterion.
Received: 26.05.2006
Citation:
V. A. Emelichev, K. G. Kuz'min, “A general approach to studying the stability of a Pareto optimal solution of a vector integer linear programming problem”, Diskr. Mat., 19:3 (2007), 79–83; Discrete Math. Appl., 17:4 (2007), 349–354
Linking options:
https://www.mathnet.ru/eng/dm966https://doi.org/10.4213/dm966 https://www.mathnet.ru/eng/dm/v19/i3/p79
|
Statistics & downloads: |
Abstract page: | 764 | Full-text PDF : | 252 | References: | 54 | First page: | 16 |
|