Exam 3 Review Sheet

Exam 3 Review Sheet - a. Be able to set up initial simplex...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
CSA 273 REVIEW SHEET FOR EXAM III TEST DATE: April 18, 2008 Material covered: 4.1, 4.2, 4.4-4.8, 4.12, 4.14, 6.1 60 points consisting of 4 - 6 problems one of which will be multiple choice. You can use an 8.5" by 11" sheet of notes and calculator. 1. Formulation of an LP problems where at least one variable is unrestricted in sign. As always a. Give clear concise definitions of the decision variables. b. State objective function and tell whether it is to maximized or minimized. c. Describe all constraints involving decision variables. 2. Sensitivity analysis of LP problems Be able to compute (graphically for two variables) a. The range of optimality for objective function coefficients using final tableau. b. Range of the right hand side of constraint where shadow price is valid. c. Shadow price of each constraint. 3. Simplex method in tableau form - the amount of tableau manipulation in each problem will be minimal.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

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.

Ask a homework question - tutors are online