Simplex-Algorithm

— Solving Linear Programs —

 Universität Bayreuth

Login:

email:

password:

Active as guest.
Guest limitations apply.
Please log in to enjoy full functionality.

Literature

  • Balinski, M. L. and Tucker, A. W. 1969: Duality Theory of Linear Programs: A Constructive Approach with Applications, SIAM Review, 113, 347–377.
  • Dantzig, Georg B. 1963: Linear Programming and Extensions. RAND, Santa Monica, http://www.rand.org/pubs/reports/R366.html.
  • Gassa, Saul I. and Vinjamuri, Sasirekha 2004: Cycling in linear programming problems, Computers & Operations Research, 31, 303–311.
  • Greenberg, Harvey J. 1997: Klee-Minty Polytope Shows Exponential Time Complexity of Simplex Method. University of Colorado, Denver, https://glossary.informs.org/notes/Klee-Minty.pdf.
  • Klee, Victor and Minty, George J. 1972: How Good Is the Simplex Algorithm?, in: Shisha, Ovid (ed.): Inequalities-III, Academic Press, New York and London.
  • Koch, Thorsten 2004: The Final Netlib-LP Results, Operations Research Letters, 322.
  • Neumann, Klaus and Morlock, Martin 1993: Operations Research, Hanser, München and Wien.

Provided free of charge for scientific purposes.
This tool comes with absolutely no warranty.
Hosting: Chair of Technology and Innovation Management, Universität Bayreuth, Bayreuth, Germany.
© Universität Bayreuth, Lehrstuhl für Technologie- und Innovationsmanagement; Programming: Stefan Seifert, Bayreuth.