Abstract
In optimization, it is used to deal with uncertain and inaccurate factors which make difficult the assignment of a single plausible value to each model parameters. Two approaches are possible: in the first one, a single nominal value is assigned to each parameter, the corresponding optimal solution is computed, then the interval in which each parameter can vary in order to preserve optimality solution is determined; the second approach consists in taking into account in the model to optimize, the possible variations of each parameter. In mathematical programming, the first approach is known as sensitivity analysis (see e.g. [6]). For the second approach, stochastic optimization may be applied for some problems in which parameters value can be described by probability laws (see for example [4]). When it is not possible nor relevant to associate probability laws to parameters, another way amounts to assign a set of possible values to each parameter. Two models may be considered: in the first one, a finite set of values is assigned to each uncertain model coefficient; in the second one, each uncertain model coefficient is associated with an interval number. In this paper, we only consider this second model called interval linear programming.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Averbakh, I., Lebedev, V.: On the complexity of minmax regret linear programming. European Journal of Operational Research 160, 227–231 (2005)
Ben-Tal, A., Nemirovski, A.: Robust solutions of uncertain linear programs. Operations Research Letters 25, 1–13 (1999)
Bertsimas, D., Sim, M.: The price of robustness. Operations Research 52(1), 35–53 (2004)
Birge, J., Louveaux, F.: Introduction to stochastic programming. Springer, Berlin (1997)
Chinneck, J.W., Ramadan, K.: Linear programming with interval coefficients. The Journal of the Operational Research Society 51(2), 209–220 (2000)
Chvatal, V.: Linear programming. W.H. Freeman, New York (1983)
Minoux, M.: Duality, robustness, and 2-stage robust lp decision models. Technical Report 7, Robustness in OR-DA, Annales du LAMSADE (2007)
Mulvey, J.M., Vanderbei, R.J., Zenios, S.A.: Robust optimization of large-scale systems. Operations Research 43(2), 264–281 (1995)
Soyster, A.L.: Convex programming with set-inclusive constraints and applications to inexact linear programming. Operations Research 21, 1154–1157 (1973)
Vincke, P.: Robust solutions and methods in decision-aid. Journal of multi-criteria decision analysis 8, 181–187 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gabrel, V., Murat, C., Remli, N. (2008). Best and Worst Optimum for Linear Programs with Interval Right Hand Sides. In: Le Thi, H.A., Bouvry, P., Pham Dinh, T. (eds) Modelling, Computation and Optimization in Information Systems and Management Sciences. MCO 2008. Communications in Computer and Information Science, vol 14. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87477-5_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-87477-5_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87476-8
Online ISBN: 978-3-540-87477-5
eBook Packages: Computer ScienceComputer Science (R0)