Abstract
Interval linear programming addresses problems with uncertain coefficients and the only information that we have is that the true values lie somewhere in the prescribed intervals. For the inequality constraint problem, computing the worst case scenario and the corresponding optimal value is an easy task, but the best case optimal value calculation is known to be NP-hard. In this paper, we discuss lower and upper bound approximation for the best case optimal value, and propose suitable methods for both of them. We also propose a not apriori exponential algorithm for computing the best case optimal value. The presented techniques are tested by randomly generated data, and also applied in a simple data classification problem.
Similar content being viewed by others
References
Fiedler, M., Nedoma, J., Ramík, J., Rohn, J., Zimmermann, K.: Linear optimization problems with inexact data. Springer, New York (2006)
Hladík, M.: Interval linear programming: a survey. In: Z.A. Mann (ed.) Linear programming-new frontiers in theory and applications, chap. 2, pp. 85–120. Nova Science Publishers, New York (2012)
Moore, R.E., Kearfott, R.B., Cloud, M.J.: Introduction to interval analysis. SIAM, Philadelphia (2009)
Neumaier, A.: Interval methods for systems of equations. Cambridge University Press, Cambridge (1990)
Chinneck, J.W., Ramadan, K.: Linear programming with interval coefficients. J. Oper. Res. Soc. 51(2), 209–220 (2000)
Hladík, M.: Optimal value range in interval linear programming. Fuzzy Optim. Decis. Mak. 8(3), 283–294 (2009)
Allahdadi, M., Nehi, H.M.: The optimal solution set of the interval linear programming problems. Optim. Lett. To appear, doi:10.1007/s11590-012-0530-4
Luo, J., Li, W.: Strong optimal solutions of interval linear programming. Linear Algebra Appl. 439(8), 2479–2493 (2013)
Gabrel, V., Murat, C., Remli, N.: Linear programming with interval right hand sides. Int. Trans. Oper. Res. 17(3), 397–408 (2010)
Hladík, M.: How to determine basis stability in interval linear programming. Optim. Lett. To appear, doi:10.1007/s11590-012-0589-y
Rohn, J.: A handbook of results on interval linear problems. technical report No. 1164, Institute of Computer Science, Academy of Sciences of the Czech Republic, Prague (2012)
Goldsztejn, A.: A right-preconditioning process for the formal-algebraic approach to inner and outer estimation of AE-solution sets. Reliab. Comput. 11(6), 443–478 (2005)
Neumaier, A.: Overestimation in linear interval equations. SIAM J. Numer. Anal. 24(1), 207–214 (1987)
Hladík, M.: Weak and strong solvability of interval linear systems of equations and inequalities. Linear Algebra Appl. 438(11), 4156–4165 (2013)
Neumaier, A.: A simple derivation of the Hansen-Bliek-Rohn-Ning-Kearfott enclosure for linear interval equations. Reliab. Comput. 5(2), 131–136 (1999)
Boyd, S., Vandenberghe, L.: Convex optimization. Cambridge University Press, Cambridge (2004)
Acknowledgments
The author was supported by the Czech Science Foundation Grant P402-13-10660S.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Hladík, M. On approximation of the best case optimal value in interval linear programming. Optim Lett 8, 1985–1997 (2014). https://doi.org/10.1007/s11590-013-0715-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-013-0715-5