Preparing the LPM for the Simplex Algorithm

Definition:

It is a general algebraic algorithmic procedure, developed by George Dantzig in 1947, based on geometric concepts and linear algebra to solve linear programming problems.

General characteristics:
  • It is an iterative algorithmic procedure in which calculations and results  of each iteration are represented in matrix or tabular form. 
  • It is intuitive.
  • It is of extraordinary efficiency.
  • It is necessary to use the computer to solve big problems (large number of variables).
  • There is a wide variety of complex software packages for this.
  • It is adaptable to other forms of models.
  • Extensions and variations of the simplex method are used to perform post-optimal analysis (including sensitivity analysis) of the model.

See the full lecture (This file is compressed. Therefore, you must install Winzip, winRAR or another compatible decompressor application on your computer.)

 Example of Gauss Jordan method

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