管理科学04-线性规划C.ppt

Chapter 4 - Linear Programming: Modeling Examples Chapter Topics Maximize Z = 11x1s + 13x2s + 9x3s + 8x1p + 10x2p + 6x3p + 6x1e + 8x2e + 4x3e subject to: x1s + x1p + x1e ? 4,500 x2s + x2p + x2e ? 2,700 x3s + x3p + x3e ? 3,500 0.50x1s - 0.50x2s - 0.50x3s ? 0 0.70x2s - 0.30x1s - 0.30x3s ? 0 0.60x1p - 0.40x2p - 0.40x3p ? 0 0.75x3p - 0.25x1p - 0.25x2p ? 0 0.40x1e- 0.60x2e- - 0.60x3e ? 0 0.90x2e - 0.10x1e - 0.10x3e ? 0 x1s + x2s + x3s ? 3,000 x1p+ x2p + x3p ? 3,000 x1e+ x2e + x3e ? 3,000 xij ? 0 A Blend Example Model Summary (3 of 6) Exhibit 4.17 A Blend Example Solution with Excel (4 of 6) Exhibit 4.18 A Blend Example Solution with Solver Window (5 of 6) Exhibit 4.19 A Blend Example Sensitivity Report (6 of 6) Production Capacity: 160 computers per week 50 more computers with overtime Assembly Costs: $190 per computer regular time; $260 per computer overtime Inventory Cost: $10/comp. per week Order schedule: Week Computer Orders 1 105 2 170 3 230 4 180 5 150 6 250 A Multi-Period Scheduling Example Problem Definition and Data (1 of 5) Decision Variables: rj = regular production of computers per week j (j = 1 - 6) oj = overtime production of computers per week j (j = 1 - 6) ij = extra computers carried over as inventory in week j (j = 1 - 5) A Multi-Period Scheduling Example Decision Variables (2 of 5) Model summary: Minimize Z = $190(r1 + r2 + r3 + r4 + r5 + r6) + $260(o1 + o2 + o3 + o4 + o5 +o6) + 10(i1 + i2 + i3 + i4 + i5) subject to: rj ? 160 (j = 1, 2, 3, 4, 5, 6) oj ? 150 (j = 1, 2, 3, 4, 5, 6) r1 + o1 - i1 ? 105 r2 + o2 + i1 - i2 ? 170 r3 + o3 + i2 - i3 ? 230 r4 + o4 + i3 - i4 ? 180 r5 + o5 + i4