Computational experience with rigorous error bounds for the netlib linear programming library

Reliable Computing

Volumn 12, Issue 4, 2006, Pages 303-321

  Keil, Christian ^a   Jansson, Christian ^a  

^a HAMBURG UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DATA REDUCTION; DIGITAL ARITHMETIC; LINEAR PROGRAMMING; NUMERICAL METHODS; PROBLEM SOLVING;

COMPUTED RIGOROUS BOUNDS; INTERVAL ARITHMETICS; NETLIB LIBRARY; RIGOROUS ERROR BOUNDS;

ERROR ANALYSIS;

EID: 33746930599     PISSN: 13853139     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11155-006-9004-7     Document Type: Article

References (21)

1. Alefeld, G. and Herzberger, J.: Introduction to Interval Computations, Academic Press, New York, 1983.
2. Beeck, H.: Linear Programming with Inexact Data, Technical Report 7830, Abteilung Mathematik, TU München, 1978.
3. Berkelaar, M., Notebaert, P., and Eikland, K.: lp_solve, http://groups.yahoo.com/group/lp_solve.
4. Floudas, C.: Deterministic Global Optimization: Theory, Methods and Applications (Nonconvex Optimization and Its Applications 37), Kluwer Academic Publishers, Dordrecht, Boston, London, 2000.
5. Fourer, R. and Gay, D. M.: Experience with a Primal Presolve Algorithm, in: Hager, W. W., Hearn, D. W., and Pardalos, P. M. (eds), Large Scale Optimization: State of the Art, Kluwer Academic Publishers, Norwell, Dordrecht, 1994, pp. 135-154.
6. Free Software Foundation: gcc, http://gcc.gnu.org.
7. Hansen, E. and Walster, G. W.: Global Optimization Using Interval Analysis, second edition, Pure and Applied Mathematics, Dekker, 2003.
8. Jansson, C.: A Rigorous Lower Bound for the Optimal Value of Convex Optimization Problems, J. Global Optimization 28 (2004), pp. 121-137.
9. Jansson, C.: Rigorous Lower and Upper Bounds in Linear Programming, SIAM J. Optim. 14 (3) (2004), pp. 914-935.
10. Kearfott, R.: Rigorous Global Search: Continuous Problems, Kluwer Academic Publishers, Dordrecht, 1996.
11. Keil, C.: LURUPA - Rigorose Fehlerschranken für Lineare Programme, Diplomarbeit, Technische Universität Hamburg-Harburg, 2004.
12. Knüppel, O.: PROFIL/BIAS and Extensions, Version 2.0, Technical report, Inst. f. Informatik III, Technische Universität Hamburg-Harburg, 1998.
13. Krawczyk, R.: Fehlerabschätzung bei linearer Optimierung, in: Nickel, K. (ed.), Interval Mathematics, Lecture Notes in Computer Science 29, Springer Verlag, Berlin, 1975, pp. 215-222.
14. Moore, R.: Methods and Applications of Interval Analysis, SIAM, Philadelphia, 1979.
15. Netlib: Netlib Linear Programming Library, http://www.netlib.org/lp.
16. Neumaier, A.: Interval Methods for Systems of Equations, Encyclopedia of Mathematics and Its Applications, Cambridge University Press, 1990.
17. Neumaier, A.: Introduction to Numerical Analysis, Cambridge University Press, 2001.
18. Neumaier, A.: Complete Search in Continuous Global Optimization and Constraint Satisfaction, Acta Numerica 13 (2004), pp. 271-369.
19. Neumaier, A. and Shcherbina, O.: Safe Bounds in Linear and Mixed-Integer Programming, Mathematical Programming, Ser. A 99 (2004), pp. 283-296.
20. Ordóñez, F. and Freund, R.: Computational Experience and the Explanatory Value of Condition Measures for Linear Optimization, SIAM J. Optimization 14 (2) (2003), pp. 307-333.
21. Rump, S.: Solving Algebraic Problems with High Accuracy. Habilitationsschrift, in: Kulisch, U. and Miranker, W. (eds), A New Approach to Scientific Computation, Academic Press, New York, 1983, pp. 51-120.