Linear programming with interval right hand sides

Linear programming with interval right hand sides

0.00 Avg rating0 Votes
Article ID: iaor20104130
Volume: 17
Issue: 3
Start Page Number: 397
End Page Number: 408
Publication Date: May 2010
Journal: International Transactions in Operational Research
Authors: , ,
Keywords: duality, interval arithmetic
Abstract:

In this paper, we study general linear programs in which right hand sides are interval numbers. This model is relevant when uncertain and inaccurate factors make difficult the assignment of a single value to each right hand side. When objective function coefficients are interval numbers in a linear program, classical criteria coming from decision theory (like the worst case criterion) are usually applied to determine robust solutions. When the set of feasible solutions is uncertain, we identify a class of linear programs for which these classical approaches are no longer relevant. However, it is possible to compute the worst optimum solution. We study the complexity of this optimization problem when each right hand side is an interval number. Then, we exhibit some duality relationships between the worst optimum solution problem and the best optimum solution to the dual problem.

Reviews

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