The Simplex Method.ppt

Software Operation (1) Select “Linear Programming” and “OK” (2) Select “File” and Click “New” (3) Specify Number of Decision Variables (4) Specify Number of Constraints (5) Specify Objective Type and “OK” (6) Put “Coefficients” (7) Solve Homework P. 78 : Prob. 2-31 (2) P. 79 : Prob. 2-38 (3) P. 132 : Prob. 3-7 (4) P. 134 : Prob. 3-10 Due day: September 8 (M) (0) (1) (2) (3) Coefficient of: Right Side BV Z Eq. 1 0 0 0 0 1 0 0 0 0 0 1 0 0 1 0 1 0 18 2 2 6 Extra 0 Solution Optimal? Yes (c) Unbounded Solution If An entering variable has zero in these coefficients in its pivoting column, then its solution can be increased indefinitely. (0) (1) Coefficient of: Right side Ratio Basic Variable Z Eq. None 1 0 -3 1 -5 0 0 1 0 4 Other Model Forms (a) Big M Method (b) Variables - Allowed to be Negative (M: a large positive number.) (a) Big M Method and Max s.t. and Max s.t. for Original Problem Artificial Problem : Artificial Variable : Slack Variables (3) (0) (4) Max: or Max: or Max: Max: s.t. Eq (3) can be changed to Put (4) into (0), then (0) (1) (2) (3) Coefficient of: Right Side BV Z Eq. 1 0 0 0 -3M-3 1 3 3 -2M-5 0 2 2 0 1 0 0 0 0 0 1 -18M 4 12 18 0 0 0 1 0 Max s.t. (1) (2) (3) (0) (1) (2) (3) Coefficient of: Right Side BV Z Eq. 1 0 0 0 -2M-5 1 0 3 3M+3 0 2 2 0 1 0 0 0 0 0 1 -6M+12 4 12 18 1 0 0 1 0 (0) (1) (2) (3) Coefficient of: Right Side BV Z Eq. 1 0 0 0 0 1 0 0 0 0 0 1 1 3 0 -1 27 4 6 3 2 0 0 1 0 (0) (1) (2) (3) Coefficient of: Right Side BV Z Eq. 1 0 0 0 0 1 0 0 0 0 0 1 0 0 1 0 0 27 4 6 3 Extra (b) Variables with a Negative Value Min s.t. Min s.t. * The Simplex Method and Maximize Subject to Example Embassy Motorcycle (EM) manufactures two lightweight motorcycles designed for easy handling and safety. The EZ-Rider model has a new engine and a low profile that make it easy to balance. The Lady-Sport model is slightly larger, uses a more traditional engine, and is specifically designed to appeal to women riders. Embassy produces the engines fo