Convergence of the Simplex algorithm

Cases with degenerate solutions:

The convergence of the algorithm is guaranteed if there is no degeneration. However, in case of degeneration of several basic variables, the algorithm can enter an infinite cycle (loop), moving through a sequence of bases that correspond to the same vertex without improving the objective function.


See the full lecture     See attached PDF document

Comments

Post a Comment

Popular posts from this blog

Simplex with artificial variables

Simplex algorithm when it is necessary to add artificial variables: The Big-𝑀 Technique. The Two-Phase Technique See the full lecture   (This file is compressed. Therefore, you must install Winzip, winRAR or another compatible decompressor application on your computer.)
Read more

LINGO Tutorials

LINGO Tutorials: Depending on the LINGO release, on the Internet you can get several tutorials to learn about how to use this important program. Below, some links of interest to get a tutorial or manual. In any case, you can extend the search and obtain a tutorial or manual according to the release installed on your computer. LINGO 15 Online Users Manual LINGO - The Modeling Language and Optimizer LINGO 8.0 Tutorial It is recommended to review and expand this information which has ben used in class and could be used to solve the model of the homework (Case Study - The company Dentsupplier).
Read more