Stability Aspects of Multicriteria Integer Linear Programming Problems


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

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 T1-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.

About the authors

S. E. Bukhtoyarov

Belarusian State University

Email: vemelichev@gmail.com
Belarus, pr. Nezavisimosti 4, Minsk, 220030

V. A. Emelichev

Belarusian State University

Author for correspondence.
Email: vemelichev@gmail.com
Belarus, pr. Nezavisimosti 4, Minsk, 220030


Copyright (c) 2019 Pleiades Publishing, Ltd.

This website uses cookies

You consent to our cookies if you continue to use our website.

About Cookies