This preview shows pages 1–5. 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: maximize Z = 25,000x1 + 18,000x2 + 31,000x3 subject to x1 + x2 + x3 = 100 Total salespersons 5,000x1 + 11,000x2 + 7,000x3 700,000 Total expenses x1 10 Minimum salespersons x2 10 Minimum salespersons x3 10 Minimum salespersons x1, x2, x3 0 and integer b). Solution: x1 = 20, x2 = 10, x3 = 70, Z = 2,850,000 4 MAT540 Chapter 5 Example Problems QM for Windows Solution 21. a) x1 = blush, x2 = white, x3 = red Maximize Z = 12,100x1 + 8,700x2 + 10,500x3 subject to: 360x1 + 375x2 + 410x3 30,000 (grapes) x1 + x2 + x3 67 (Storage) 14x1 + 10x2 + 18x3 2,200 (production) x1/x3 2 or x1  2x3 0 (blush to red) x2/x1 1.5 or x2  1.5x1 0 (white to blush) x1, x2, x3 0 and integer b) Integer solution: x1 = 22 x2 = 33 x3 = 11 Z = $668,800 5...
View Full
Document
 Spring '10
 AZAD

Click to edit the document details