6. Simplex convergence
At each stage of the simplex algorithm (in phase 2), we can distinguish remarkable cases, all of which lead to the algorithm being stopped:
1. If the reduced costs are all strictly negative, i.e. , then the current feasible basic solution is the unique optimum (see figure 3);
You do not have access to this resource.
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed?
Log in!
Ongoing reading
Simplex convergence
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!