Abstract
A multicriteria integer linear programming problem with a finite number of admissible solutions is considered. The problem consists in finding the Pareto set. Lower and upper attainable estimates of the radius of strong stability of the problem are obtained in the case when the norm in the space of solutions is arbitrary, and the norm in the criteria space is monotone. Using the Minkowski-Mahler inequality, a formula for calculating this radius is derived in the case when the Pareto set consists of a single solution. Estimates of the radius are also found in the case of the Holder norm in the specified spaces. A class of problems is distinguished for which the radius of strong stability is infinite. As corollaries, certain results known earlier are derived. Illustrative numerical examples are also presented.
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: Journal of Computer and Systems Sciences International
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.
