Simplex algorithm: Difference between revisions

Revision as of 07:07, 16 March 2006

Revision as of 02:25, 24 March 2006

Line 62:

*: Modify '''B''' and <math>\mathbf{c}_B</math> to account for the new basic variables. This will automatically make the tableau diagonal for the existing and new basic variables.

** '''Check for improvement'''

*: Repeat procedure until no further improvement is possible, meaning all the coefficients of <math>\mathbf{c}_B \mathbf{B}^{-1}\mathbf{A} -\mathbf{c}</math> are positive. Procedure is also terminated if all coefficients are zero, and the algorithm havehas been walkingwalked in a circle and revisited a previous state.

== Description ==