Stability Aspects of Multicriteria Integer Linear Programming Problems

Abstract

Under consideration are the multicriteria integer linear programming problems with finitely many feasible solutions. The problem itself consists in finding a set of extremal solutions. We derive some lower and upper bounds for the T₁-stability radius under assumption that arbitrary Hölder norms are given in the solution and criteria spaces. A class of the problems with an infinitely large stability radius is specified. We also consider the case of the multicriteria linear Boolean problem.