Scribd
Upload
21 views7 pages

Lecture 62

The document discusses the simplex method for solving linear programs including initialization, optimality testing, and iterating to find solutions. It also covers tie breaking rules and adapting the method to non-standard problem forms such as models with equality constraints, negative right-hand sides, or minimization objectives.

Uploaded by

Pro Hammad
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
21 views7 pages

Lecture 62

The document discusses the simplex method for solving linear programs including initialization, optimality testing, and iterating to find solutions. It also covers tie breaking rules and adapting the method to non-standard problem forms such as models with equality constraints, negative right-hand sides, or minimization objectives.

Uploaded by

Pro Hammad
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 7

Lecture

Shahid ismail
The Simplex Method in Tabular Form
• Summary of the simplex method
• Initialization
• Introduce slack variables
• Optimality test
• Optimal if and only if every coefficient in row 0 is nonnegative
• Iterate (if necessary) to obtain the next BF solution
• Determine entering and leaving basic variables
• Minimum ratio test

2
4.5 Tie Breaking in the Simplex Method
• Tie for the entering basic variable
• Decision may be made arbitrarily
• Tie for the leaving basic variable
• Matters theoretically but rarely in practice
• Choose arbitrarily
• Condition of no leaving basic variable
• Z is unbounded
• Indicates a mistake has been made

3
Tie Breaking in the Simplex Method
• Multiple optimal solutions
• Simplex method stops after one optimal BF solution is found
• Often other optimal solutions exist and would be meaningful choices
• Method exists to detect and find other optimal BF solutions

4
4.6 Adapting to Other Model Forms
• Simplex method adjustments
• Needed when problem is not in standard form
• Made during initialization step
• Artificial-variable technique
• Dummy variable introduced into each constraint that needs one
• Becomes initial basic variable for that equation

5
Adapting to Other Model Forms
• Types of nonstandard forms
• Equality constraints
• Negative right-hand sides
• Functional constraints in greater-than-or-equal-to form
• Minimizing Z
• Solving the radiation therapy problem
• Text reviews two methods: Big M and two-phase

6
Adapting to Other Model Forms
• No feasible solutions
• Constructing an artificial feasible solution may lead to a false optimal solution
• Artificial-variable technique provides a way to indicate whether this is the
case
• Variables are allowed to be negative
• Example: negative value indicates a decrease in production rate
• Negative values may have a bound or no bound

You might also like