Skip to main content
Springer Nature Link
Log in

Rigorous Error Bounds for the Optimal Value of Linear Programming Problems

  • Conference paper
Global Optimization and Constraint Satisfaction (COCOS 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2861))

  • 681 Accesses

Abstract

We consider the computation of rigorous lower and upper error bounds for the optimal value in linear programming.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Floudas, C.A.: Deterministic Global Optimization - Theory, Methods and Applications. Nonconvex Optimization and Its Applications, vol. 37. Kluwer Academic Publishers, Dordrecht (2000)

    Google Scholar 

  2. Floudas, C.A., Pardalos, P.M.: Encyclopedia of Optimization. Kluwer Academic Publishers, Dordrecht (2001)

    Book  MATH  Google Scholar 

  3. Hansen, E.R.: Global Optimization using Interval Analysis. Marcel Dekker, New York (1992)

    MATH  Google Scholar 

  4. Jansson, C.: Rigorous Lower and Upper Bounds in Linear Programming. Technical Report 02.1, Forschungsschwerpunkt Informations- und Kommunikationstechnik, TU Hamburg-Harburg (2002), http://www.ti3.tu-harburg.de/paper/jansson/verification.ps

  5. Kearfott, R.B.: On proving existence of feasible points in equality constrained optimization problems, Deptartment of Mathematics, Univ. of Southwestern Louisiana, U. S. L. Box 4-1010, Lafayette, La 70504 (1994) (preprint)

    Google Scholar 

  6. Kearfott, R.B.: On verifying feasiblility in equality constrained optimization problems. Technical report, Deptartment of Mathematics, Univ. of Southwestern Louisiana (1994)

    Google Scholar 

  7. Kearfott, R.B.: Rigorous Global Search: Continuous Problems. Kluwer Academic Publisher, Dordrecht (1996)

    MATH  Google Scholar 

  8. Knüppel, O.: PROFIL / BIAS — A Fast Interval Library. Computing 53, 277–287 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  9. lp-solve 4.0-1, http://packages.debian.org/unstable/math/lp-solve.html

  10. NETLIB Linear Programming Library, http://www.netlib.org/lp

  11. Neumaier, A.: Introduction to Numerical Analysis. Cambridge University Press, Cambridge (2001)

    Book  MATH  Google Scholar 

  12. Neumaier, A., Shcherbina, O.: Safe bounds in linear and mixed-integer programming (submitted for publication)

    Google Scholar 

  13. Ordóñez, F., Freund, R.M.: Computational experience and the explanatory value of condition numbers for linear optimization. Technical Report MIT Operations Research Center Working Paper OR361-02, MIT (2002) (submitted for publication to SIAM J. Optimization), http://web.mit.edu/rfreund/www/CVfreund.pdf

  14. Rosen, J.B., Suzuki, S.: Construction of Nonlinear Programming Test Problems. Communication of ACM 8, 113 (1965)

    Article  Google Scholar 

  15. Tawaralani, M., Sahinidis, N.V.: Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming. Kluwer Academic Publishers, Dordrecht (2002)

    Google Scholar 

  16. Vanderbei, R.J.: Linear Programming: Foundations and Extensions. Kluwer Academic Publishers, Dordrecht (1996)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Inst. of Computer Science III, Technical University Hamburg-Harburg, Schwarzenbergstraße 95, 21071, Hamburg, Germany

    Christian Jansson

Authors
  1. Christian Jansson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. ILOG, 1681-HB2 Route des Dolines, 06560, Valbonne, France

    Christian Bliek

  2. LINA, FRE CNRS 2729 – University of Nantes, 2, rue de la Houssinière – BP 92208, F-44322, Nantes cedex 3, France

    Christophe Jermann

  3. Institute for Mathematics, University Wien, Nordbergstr. 15, A-1090, Wien, Austria

    Arnold Neumaier

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jansson, C. (2003). Rigorous Error Bounds for the Optimal Value of Linear Programming Problems. In: Bliek, C., Jermann, C., Neumaier, A. (eds) Global Optimization and Constraint Satisfaction. COCOS 2002. Lecture Notes in Computer Science, vol 2861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39901-8_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39901-8_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20463-3

  • Online ISBN: 978-3-540-39901-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics