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!

The Ultimate Scientific and Technical Reference

A Comprehensive Knowledge Base, with over 1,200 authors and 100 scientific advisors

+ More than 10,000 articles and 1,000 how-to sheets, over 800 new or updated articles every year

From design to prototyping, right through to industrialization, the reference for securing the development of your industrial projects

This article is included in

Mathematics

This offer includes:

Knowledge Base

Updated and enriched with articles validated by our scientific committees

Services

A set of exclusive tools to complement the resources

Practical Path

Operational and didactic, to guarantee the acquisition of transversal skills

Doc & Quiz

Interactive articles with quizzes, for constructive reading

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. -...