Scribd
Upload
3 views14 pages

Online Simplex Method Lecture

The document discusses the Simplex method for solving linear programming problems, focusing on maximizing an objective function subject to constraints. It includes examples and explains the use of Simplex tableaux and Gaussian elimination. Key concepts such as basic and nonbasic variables, entering and leaving variables, and the stopping criteria for the algorithm are also highlighted.

Uploaded by

Nguyen Trong Tin
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views14 pages

Online Simplex Method Lecture

The document discusses the Simplex method for solving linear programming problems, focusing on maximizing an objective function subject to constraints. It includes examples and explains the use of Simplex tableaux and Gaussian elimination. Key concepts such as basic and nonbasic variables, entering and leaving variables, and the stopping criteria for the algorithm are also highlighted.

Uploaded by

Nguyen Trong Tin
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Simplex method

Online lecture
Thinh Tien Nguyen, Ph.D.
Linear program

maximize

subject to

where

b0
Example

maximize

subject to
Standard form

maximize

subject to

where

slack variables
Simplex method

maximize

nonbasic variables
subject to
basic variables

entering variable
leaving variable
Simplex tableau
Simplex tableau
Simplex tableau

Gaussian elimination
Simplex tableau

Stop if the circled coefficients are non-negative


Example

maximize maximize

subject to subject to
Example

-4 is the smallest
Example

The smallest ratio is 8/4=2


Example

-1 is a negative number
Example

You might also like