The Simplex Algorithm

  • Michel Sakarovitch
Part of the Springer Texts in Electrical Engineering book series (STELE)

Abstract

The simplex algorithm was discovered in 1947 by G. Dantzig as a tool to solve linear programs„ Simplex algorithm is central to this course on linear programming because it exemplifies the process of operations research described in the preface: it is not only a very efficient way (its efficiency is not yet completely understood) of solving practical problems, used innumerable times by engineers, industrialists, and military people, but it is also the basis of a mathematical theory that can be used to prove various results.

Keywords

Simplex Algorithm Chapter Versus Feasible Basis Innumerable Time Military People 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1983

Authors and Affiliations

  • Michel Sakarovitch
    • 1
  1. 1.Laboratoire I.M.A.G.Université Scientifique et Medicale de GrenobleGrenoble CedexFrance

Personalised recommendations