Home A general approach to studying the stability of a Pareto optimal solution of a vector integer linear programming problem
Article
Licensed
Unlicensed Requires Authentication

A general approach to studying the stability of a Pareto optimal solution of a vector integer linear programming problem

  • V. A. Emelichev and K. G. Kuzmin
Published/Copyright: December 4, 2007
Become an author with De Gruyter Brill
Discrete Mathematics and Applications
From the journal Volume 17 Issue 4

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.

Published Online: 2007-12-04
Published in Print: 2007-10-19

© de Gruyter

Downloaded on 30.11.2025 from https://www.degruyterbrill.com/document/doi/10.1515/dma.2007.029/pdf
Scroll to top button