11. Conclusion
The fundamental properties of solutions to linear programming problems have been established. The simplex method was presented for solving a linear program in which an objective function is sought to be maximized. It is an iterative method that involves examining the vertices of the constraint polyhedron to increase the objective function. The simplex method has been implemented in two different ways: firstly, using dictionaries, and secondly, with an array method consisting in updating the inverse of the basic constraint matrix. The latter method is implemented in a MATLAB code provided in the appendix (§
10.2
You do not have access to this resource.
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed?
Log in!
Ongoing reading
Conclusion
Bibliography
-
(1) - BILLIONNET (A.) - Optimisation discrète – De la modélisation à la résolution par des logiciels de programmation mathématique. - Dunod (2007).
-
(2) - BREZINSKI (C.) - Initiation à la programmation linéaire et à l'algorithme du simplexe. - Ellipse, Paris (2006).
-
(3)...
Also in our database
-
MINOUX (M.) - Optimisation en nombres entiers. - [AF 1 251], Méthodes numériques (2008).
...
Software tools
GLPK – Gnu Linear Programming Kit (Linux version) [Software]
LPSOLVE, (multi-platform version under LGPL license)
IBM ILOG CPLEX Optimization Studio (multi-platform version)
MATLAB – Optimization toolbox
CMPL – <Coliop|Coin> Mathematical Programming Language
Websites
COIN-OR: COmputational INfrastructure for Operations Research
http://www.coin-or.org/
ROADEF: French Society for Operational Research and Decision Support
http://www.roadef.org/content/index.htm
ENSTA Operations Research Portal
You do not have access to this resource.
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed?
Log in!