Tutorial9sol - Tutorial 9: Outline of Solutions Q1....

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Tutorial 9: Outline of Solutions Q1. Consider the following linear programming problem. min 5 x 1- 5 x 2- 13 x 3 s.t.- x 1 + x 2 + 3 x 3 ≤ 20 12 x 1 + 4 x 2 + 10 x 3 ≤ 90 x 1 ,x 2 ,x 3 ≥ Let x 4 and x 5 denote the slack variables for the respective constraints. The optimal tableau is given below: Basic x 1 x 2 x 3 x 4 x 5 Solution ¯ c 2 5 100 x 2- 1 1 3 1 20 x 5 16- 2- 4 1 10 You are expected to conduct sensitivity analysis by independently investigating each of the following changes in the original model. For each change, use the sensitivity analysis procedure to obtain the new optimal solution and the new optimal objective value. (a) Change the right-hand side of the first constraint to b 1 = 30. (b) Change the right-hand sides to b 1 b 2 = 10 100 . (c) Change the coefficient of x 3 in the objective function to c 3 = 8. (d) Change the coefficient of x 2 in the objective function to c 2 =- 3. (d) Change the coefficients of x 1 to c 1 a 11 a 21 = - 2 5 . Solution : (a) x B = B- 1 30 90 ! = 30- 30 ! 6≥ not feasible. And- c B B- 1 b = 150. Apply dual simplex algorithm: Basic x 1 x 2 x 3 x 4 x 5 Solution ¯ c 2 5 150 x 2- 1 1 3 1 30 x 5 16- 2- 4 1- 30 ¯ c 16 1 1 120 x 2 23 1- 5 3 2- 15 x 3- 8 1 2- 1 2 15 ¯ c 103 5 1 5 13 10 117 x 4- 23 5- 1 5 1- 3 10 3 x 3 6 5 2 5 1- 1 10 9 1 (b) b 1 b 2 ! = 10 100 ! . x B = B- 1 10 100 ! = 10 60 ! ≥ is feasible. Optimal solution is x = (0 , 10 , , , 60) , with optimal objective value- 50. (c) Changing c 3 may affect the optimality conditions. ( x 3 nonbasic variable) Check ¯ c 3 : ¯ c 3 = c 3- c B B- 1 A 3 = 8- (- 5 , 0) 3- 2 = 23 > . Optimality condition satisfied. The current basis matrix is optimal. Same optimal solution. (d) x 2 is a basic variable. Check reduced costs for all nonbasic variables. New c B = (- 3 , 0). (¯ c 1 , ¯ c 3 , ¯ c 4 ) = ( c 1 ,c 3 ,c 4 )- c B B- 1 ( A 1 ,A 3 ,A 4 ) = (5 ,- 13 , 0)- (- 3 , 0) 1- 4 1- 1 3 1 12 10 0 = (5 ,- 13 , 0)- (- 3 , 0)- 1 3 1 16- 2- 4 = (2 ,- 4 , 3) Re-optimization Basic x 1 x 2 x 3 x 4 x 5 Solution ¯ c 2- 4 3 60 x 2- 1 1 3 1 20 x 5 16- 2- 4 1 10 ¯ c 2 3 4 3 4 1 3 260 3 x 3- 1 3 1 3 1 1 3 20 3 x 5 15 1 3 2 3- 3 1 3 1 70 3 The optimal solution is x * = (0 , , 20 3 , , 70 3 ) , with the optimal objective value- 260 3 ....
View Full Document

This note was uploaded on 12/02/2011 for the course MATH 3252 taught by Professor Tanbanpin during the Spring '10 term at National University of Singapore.

Page1 / 7

Tutorial9sol - Tutorial 9: Outline of Solutions Q1....

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online