On the stability radius of the vector problem of integer linear programming

On the stability radius of the vector problem of integer linear programming

0.00 Avg rating—0 Votes
Article ID: iaor20072089
Country: Belarus
Volume: 2
Start Page Number: 84
End Page Number: 93
Publication Date: Apr 2006
Journal: Informatics
Authors: ,
Keywords: programming: integer
Abstract:

For the vector problem of integer linear programming with Pareto optimality principle, lower and upper bounds of the stability radius of the problem are obtained for the case of l1 metric in the space of problem parameters. Attainability of the lower estimate is shown. As a corollary we derive a formula for the stability radius of the problem with a single optimal solution.

Reviews

Required fields are marked *. Your email address will not be published.