Abstract
In this paper, we consider a multicriteria integer linear programming problem with a parametric principle of optimality. Parameterization is realized by dividing the set of criteria into several disjoint groups (subsets) of criteria ordered by importance, with Pareto dominance within each group. The introduced parametric principle of optimality made it possible to connect such classical principles of optimality as lexicographic and Pareto ones. For the stability radius, which is the limiting level of perturbations of the parameters of the problem, not causing the appearance of new optimal solutions, the upper and lower estimations are obtained in the case of arbitrary Hölder’s norms in the criterion space and solution space. Some previously known results on the stability of the Boolean linear programming problem are formulated as corollaries.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Proceedings of the National Academy of Sciences of Belarus. Physics and Mathematics Series
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
