This preview shows pages 1–4. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: as the acceptable region. Then graph the first constraint. (x 2 =60x1) Since we are minimizing overutilization, we consider the area to the left as the acceptable region. Since the two regions do not overlap, we choose a point in the first region that is closest to the second: x 1 =80, x 2 =0. Thus, u 2 =0,v 1 =200. d. Even though this changes the priorities, the acceptable regions would still be the same; however we would choose a point from constraint ones region that is closest to the other acceptable region: x 1 =60, x 2 =0. Thus, v 1 =0, u 2 =20. 9. Note: Profit is a hard constraint. S=1.1, T=7.02, v 1 =0, u 2 =0, u 3 =2.98, u 4 =7.90 13....
View Full
Document
 Spring '05
 EL

Click to edit the document details