This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: APM236 HW6 due Wed. March 30 NAME: 1. The following matrix T consists of columns t j of the nal tableau of a LPP together; and b and c are usual cost and resources vectors. Assume the last three variables were slack variables and the nal basic variables are x 5 , x 1 and x 2 in this order. T = 1 7 0 0 23 14 7 1 5 7 0 8 14 0 3 1 0 7 12 7 0 1 2 , b = 12 18 16 , c = 1 2 4 3 a) Determine by how much we can change the values of the resource b 2 without changing the feaibility of the optimal solution. b) Decrease the value of b 2 to 5, and if the optimal solution loses its feasibility use the dual simplex method to nd a new optimal solution (one that is feasible.) Page 1 of 6 APM236 HW6 due Wed. March 30 NAME: c) Back again to the anl tableau as above. Determine the range of values that c 4 can change without changing the optimality of the optimal solution....
View
Full
Document
This document was uploaded on 04/27/2011.
 Spring '09

Click to edit the document details