Post-optimal analysis for multicriteria integer linear programming problem of finding extreme solutions

We consider a multicriteria problem of integer linear programming and study the set of all individual criterion minimizers (extreme solutions) playing an important role in determining the range of Pareto optimal set. In this work, the lower and upper attainable bounds on the stability radius of the set of extreme solutions are obtained in the situation where solution and criterion spaces are endowed with various H¨older’s norms. In addition, the case of the Boolean problem is analyzed. Some computational challenges are also discussed.