Skip to main content
SpringerLink
Log in

Interval linear programming

  • Chapter
Linear Optimization Problems with Inexact Data

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

3.8 Notes and references

  1. H. Bauch, K.-U. Jahn, D. Oelschlägel, H. Süsse, and V. Wiebigke, Intervall mathematik, Teubner, Leipzig, 1987.

    Google Scholar 

  2. H. Beeck, Linear programming with inexact data, Technical Report TUM-ISU-7830, Technical University of Munich, Munich, 1978.

    Google Scholar 

  3. S. Filipowski, On the complexity of solving feasible systems of linear inequalities specified with approximate data, Mathematical Programming, 71 (1995), pp. 259–288.

    MATH  MathSciNet  Google Scholar 

  4. D. Gale, H. W. Kuhn, and W. Tucker, Linear programming and the theory of games, in Activity Analysis of Production and Allocation, T. C. Koopmans, ed., Cowles Commission for Research in Economics, Monograph Nr. 13, John Wiley and Sons, New York, 1951, pp. 317–329.

    Google Scholar 

  5. C. Jansson, Zur linearen Optimierung mit unscharfen Daten, PhD thesis, University of Kaiserslautern, 1985.

    Google Scholar 

  6. C. Jansson, A self-validating method for solving linear programming problems with interval input data, Computing Supplementum, 6 (1988), pp. 33–46.

    MATH  MathSciNet  Google Scholar 

  7. C. Jansson, On self-validating methods for optimization problems, in Topics in Validated Computations, J. Herzberger, ed., North-Holland, Amsterdam, 1994, pp. 381–438.

    Google Scholar 

  8. C. Jansson and S. M. Rump, Rigorous solution of linear programming problems with uncertain data, ZOR-Methods and Models of Operations Research, 35 (1991), pp. 87–111.

    Article  MATH  MathSciNet  Google Scholar 

  9. J. Koníčková, Optimalizační úlohy s nepřesnymi daty, PhD thesis, Charles University, Prague, 1996.

    Google Scholar 

  10. J. Koníčková, Sufficient condition of basis stability of an interval linear programming problem, Zeitschrift für Angewandte Mathematik und Mechanik, Supplement 3,81 (2001), pp. S677–S678.

    Google Scholar 

  11. R. Krawczyk, Fehlerabschätzung bei linearer Optimierung, in Interval Mathematics, K. Nickel, ed., Lecture Notes in Computer Science 29, Berlin, 1975, Springer-Verlag, pp. 215–222.

    Google Scholar 

  12. B. Machost, Numerische Behandlung des Simplexverfahrens mit intervallanalytischen Methoden, Berichte der GMD 30, GMD, Bonn, 1970.

    Google Scholar 

  13. F. Mráz, Interval linear programming problem, Freiburger Intervall-Berichte 87/6, Albert-Ludwigs-Universität, Freiburg, 1987.

    Google Scholar 

  14. F. Mráz, Solution function of an interval linear programming problem, Report 90-03, The Technical University of Denmark, Lyngby, 1990.

    Google Scholar 

  15. F. Mráz, On supremum of the solution function in linear programs with interval coefficients, Research Report, KAM Series 93-236, Faculty of Mathematics and Physics, Charles University, Prague, 1993.

    Google Scholar 

  16. F. Mráz, Úloha lineárního programování s intervalovými koeficienty. West Bohemian University, 1993. Habilitationsschrift.

    Google Scholar 

  17. F. Mráz, The exact lower bound of optimal values in interval LP, in Scientific Computing and Validated Numerics, G. Alefeld, A. Frommer and B. Lang, eds., Mathematical Research, Vol. 90, Berlin, 1996, Akademie Verlag, pp. 214–220.

    Google Scholar 

  18. F. Mráz, Calculating the exact bounds of optimal values in LP with interval coefficients, Annals of Operations Research, 81 (1998), pp. 51–62.

    Article  MATH  MathSciNet  Google Scholar 

  19. J. Nedoma, Vague matrices in linear programming, Annals of Operations Research, 47 (1993), pp. 483–496.

    Article  MATH  MathSciNet  Google Scholar 

  20. J. Ramík, Linear programming with inexact and fuzzy coefficients. Faculty of Mathematics and Physics, Charles University, 1991. Habilitationsschrift.

    Google Scholar 

  21. J. Ramík, Linear programming with inexact coefficients: Some results in computational complexity, Research Report, Japan Advanced Institute for Science and Technology, Hokuriku, 1999.

    Google Scholar 

  22. J. Renegar, Some perturbation theory for linear programming, Mathematical Programming, 65 (1994), pp. 73–91.

    Article  MATH  MathSciNet  Google Scholar 

  23. J. Rohn, Soustavy lineárních rovnic s intervalově zadanými koeficienty, Ekonomicko-matematický obzor, 12 (1976), pp. 311–315.

    MATH  MathSciNet  Google Scholar 

  24. J. Rohn, Duality in interval linear programming, in Interval Mathematics 1980, K. Nickel, ed., Academic Press, New York, 1980, pp. 521–529.

    Google Scholar 

  25. J. Rohn, Strong solvability of interval linear programming problems, Computing, 26 (1981), pp. 79–82.

    Article  MATH  MathSciNet  Google Scholar 

  26. J. Rohn, Interval linear systems, Freiburger Intervall-Berichte 84/7, Albert-Ludwigs-Universität, Freiburg, 1984.

    Google Scholar 

  27. J. Rohn, On sensitivity of the optimal value of a linear program, Ekonomickomatematický obzor, 25 (1989), pp. 105–107.

    MATH  MathSciNet  Google Scholar 

  28. J. Rohn, Stability of the optimal basis of a linear program under uncertainty, Operations Research Letters, 13 (1993), pp. 9–12.

    Article  MATH  MathSciNet  Google Scholar 

  29. J. Rohn, NP-hardness results for some linear and quadratic problems, Technical Report 619, Institute of Computer Science, Academy of Sciences of the Czech Republic, Prague, January 1995.

    Google Scholar 

  30. J. Rohn, Linear programming with inexact data is NP-hard, Zeitschrift für Angewandte Mathematik und Mechanik, Supplement 3, 78 (1998), pp. S1051–S1052.

    MATH  MathSciNet  Google Scholar 

  31. A. A. Vatolin, On linear programming problems with interval coefficients (in Russian), Zhurnal Vychislitel’noi Matematiki i Matematicheskoi Fiziki, 24 (1984), pp. 1629–1637.

    MATH  MathSciNet  Google Scholar 

  32. J. R. Vera, Ill-posedness and the complexity of deciding existence of solutions to linear programs, SIAM Journal on Optimization, 6 (1996), pp. 549–569.

    Article  MATH  MathSciNet  Google Scholar 

  33. J. von Neumann, On a Maximization Problem, Institute of Advanced Studies, Princeton, 1947. Manuscript.

    Google Scholar 

Download references

Authors
  1. J. Rohn
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer Science+Business Media, Inc.

About this chapter

Cite this chapter

Rohn, J. (2006). Interval linear programming. In: Linear Optimization Problems with Inexact Data. Springer, Boston, MA. https://doi.org/10.1007/0-387-32698-7_3

Download citation

Publish with us

Policies and ethics

Search

Navigation