Skip to main content
SpringerLink
Log in

Rigorous solution of linear programming problems with uncertain data

  • Published:
Zeitschrift für Operations Research Aims and scope Submit manuscript

Abstract

This note gives a synopsis of new methods for solving linear systems and linear programming problems with uncertain data. All input data can vary between given lower and upper bounds. The methods calculate very sharp and guaranteed error bounds for the solution set of those problems and permit a rigorous sensitivity analysis. For problems with exact input data in general the calculated bounds differ only in the last bit in the mantissa, i.e. they are of maximum accuracy.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alefeld G, Herzberger J (1974) Einführung in die Intervallrechnung, B.I. Wissen-schaftsverlag

  2. Alefeld G, Herzberger J (1983) Introduction to Interval Computations, Academic Press

  3. Bauch H, Jahn KU, Oelschlägel D, Süsse H, Wiebigke V (1987) Intervallmathematik, Theorie und Anwendungen, Mathematische-Naturwissenschaftliche Bibliothek, Band 72, B.G. Teubner, Leipzig

    Google Scholar 

  4. Beeck H (1978) Linear Programming with Inexact Data, Bericht Nr. 7830 der Abteilung Mathematik TU München

  5. Bellmann R (1961) Adaptive Control Processes, Princeton University Press

  6. Bleher JH Rump SM, Kulisch U, Metzger M, Ullrich Ch, Walter W (1987) FOR-TRAN-SC: A Study of a FORTRAN Extension for Engineering/Scientific Computation with Access to ACRITH, Computing 39: 93–110, Springer

  7. Bohlender G, Kaucher E, Klatte R, Kulisch U, Miranker WL, Ullrich Ch, Wolff v Gudenberg J (1981) FORTRAN for Contemporary Numerical Computation, IBM Research Report RC 8348 (1980). Computing 26: 277–314

    Article  Google Scholar 

  8. Chvatal V (1983) Linear Programming, WH Freemann and Company

  9. Deif A (1986) Sensitivity Analysis in Linear Systems, Springer, New York

    Google Scholar 

  10. Husung D (1988) - ABACUS - Programmierwerkzeug mit hochgenauer Arithmetik für Algorithmen mit verifizierten Ergebnissen, Diplomarbeit, Karlsruhe

  11. Husung D (1989) Precompiler for Scientific Computation (TPX), Informatik III, TU Hamburg-Harburg

  12. Husung D, Rump SM (1989) ABACUS, Proceedings SCAN'89, Tagung „Wissenschaftliches Rechnen und Programmiersprachen“, Basel

  13. IBM System/370 RPQ High-Accuracy Arithmetic (1984) SA 22-7093-0

  14. IBM High-Accuracy Arithmetic Subroutine Library (ACRITH) (April 1986) General Information Manual, GC 33-6163-02, 3rd Edition

  15. IBM High-Accuracy Arithmetic Subroutine Library (ACRITH), Program Description and User's Guide (April 1986) SC 33-6164-02, 3rd Edition

  16. IEEE Standard for Binary Floating-Point Arithmetic (1985), ANSI/IEEE Standard 754

  17. Jansson C (1985) Zur linearen Optimierung mit unscharfen Daten, Dissertation, Kaiserslautern

  18. Jansson C (1988) A Selv-Validating Method for Solving Linear Programming Problems, Computing, Suppl. 6: 33–46

    MATH  MathSciNet  Google Scholar 

  19. Krawzcyk R (1975) Fehlerabschätzung bei linearer Optimierung, Interval Mathematics: 215–227, Springer Lecture Notes in Computer Science 29

  20. Kulisch U W (1976) Grundlagen des numerischen Rechnens, B.I. Wissenschaftsverlag

  21. Kulisch UW (1981) Computer Arithmetic in Theory and Practice, Academic Press, New York

    Google Scholar 

  22. Kulisch UW, Miranker WL (1983) A New Approach to Scientific Computation, Academic Press New York

    Google Scholar 

  23. Kulisch U (1987) (ed.): PASCAL-SC: A PASCAL Extension for Scientific Computation, Information Manual and Floppy Disks, Version IBM PC. Stuttgart, B.G. Teubner; Chichester: John Wiley & Sons

    Google Scholar 

  24. Machost B (1970) Numerische Behandlung des Simplexverfahrens mit intervallmathematischen Methoden, Berichte der GMD Bonn, Nr. 30

  25. Maichle U (1988) Lineare Intervalloptimierung und Anwendungen, Diplomarbeit, Kaiserslautern

  26. Markov S, Velichkov T (1989) HIFICOMP, a subroutine library for highly efficient and accurate computation, Proceedings SCAN'89, Tagung „Wissenschaftliches Rechnen und Programmiersprachen“, Basel

  27. Moore RE (1979) Methods and Applications of Interval Analysis, SIAM Philadelphia

  28. Neumaier A (1990) Interval Methods for Systems of Equations, Cambridge University Press, to be published.

  29. Papadimitrion CH, Steiglitz K (1982) Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall

  30. Rohn J (1984) Solving Interval Linear Systems, Freiburger Intervallberichte 84/7: 1–30

    Google Scholar 

  31. Rump SM (1980) Kleine Fehlerschranken bei Matrixproblemen, Dr.-Dissertation, Institut für Angewandte Mathematik, Universität Karlsruhe

  32. Rump SM (1983) Solving Algebraic Problems with High Accuracy, Habilitationsschrift, in: A New Approach to Scientific Computation, Hrsg UW Kulisch und WL Miranker, ACADEMIC PRESS: 51–120

  33. Rump SM(1989) CALCULUS, in „Wissenschaftliches Rechnen mit Ergebnisverifikation“, ed U Kulisch, Vieweg und Akademie Verlag Berlin

  34. Rump SM (1990) Rigorous Sensitivity Analysis for Systems of Linear and Nonlinear Equations, to appear in MATH of COMP

  35. Siemens ARITHMOS, (BS 2000) Benutzerhandbuch (1986) SIEMENS AG, U2900-I-Z87-1

  36. Steuer RE (1981) Algorithms for Linear Programming Problems with Interval Objective Function Coefficients, Mathematics of Oper. Res., Vol. 6: 222–248

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Informatorik III, Technische Universität Hamburg-Harburg, Eißendorfer Straße 38, 2100, Hamburg 90

    C. Jansson &  S. M. Rump

Authors
  1. C. Jansson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. M. Rump
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This is a written account of an invited lecture delivered by the second author on occasion of the 14. Symposium über Operations Research, Ulm, 6.–8.9.1989.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jansson, C., Rump, S.M. Rigorous solution of linear programming problems with uncertain data. ZOR - Methods and Models of Operations Research 35, 87–111 (1991). https://doi.org/10.1007/BF02331571

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02331571

Keywords

Search

Navigation