This preview shows page 1. Sign up to view the full content.
Unformatted text preview: a. Be able to set up initial simplex tableaus. b. Go through one iteration of the simplex method to find the next basic feasible solution. c. Interpret the final optimal tableau d. Be able to set up the initial simplex tableau where artificial variables must be inserted using the Big M method. Be able to identify (1) the corresponding initial (artificial) basic feasible solution. (2) the initial entering basic variable (3) the leaving basic variable. e. Problems where artificial variables are usually required. (1) Minimization problem (2) LP problems with equality constraints. (3) Maximization problems with > constraints. f. From a simplex tableau be able to identify (1) when the current basic feasible solution is optimal. (2) an unbounded problem. (3) an infeasible problem. (4) a problem having more than one basic optimal solution. (5) a basic feasible solution that is degenerate....
View Full Document
This note was uploaded on 04/17/2008 for the course CSA 273 taught by Professor Patton during the Spring '08 term at Miami University.
- Spring '08