Simplex method
Users: 2 - Average Rating: 4.50
The method was developed by George Dantzig and discussed and published in 1947. It is one of the most used methods for practical planning problems. It optimizes a linear objective under a linearly constrained feasible set. During 75 years, implementations have been developed and the method has been tuned, such that with noeadays large computers, we can handle problems with many variables and constraints.
Scientific Area:
C, C++, MatLab, Python, R
Language/Environments:
Optimization
Target Group:
Basic
Link:
Cite as:
Murty, Katta G. (1983). Linear programming. New York: John Wiley & Sons, Inc. pp. xix+482. ISBN 978-0-471-09725-9. MR 0720547.
Author of the review:
Eligius Hendrix
University of Malaga
You have to login to leave a comment. If you are not registered click here
Mauro Bozzetti
Thank you. Very nice.Maria de Fátima Pacheco
Considering the wide scope of applications of the simplex method, available implementations like this one are great value for begginers.