This preview shows pages 1–2. 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: x1 = x7 = x11= x12 =1 Optimal value = 4. c. (10 points) Change the constraint for room 7 to x2+x5+x9+x11 2 d. (10 points) Solution via Excel: x3 = x6 = x9 = x11 = x12 = 1. Thus, cameras should be located at openings 3,6,9,11, and 12. An alternate optimal solution is x2 = x4 = x6 = x10 = x11 = 1. Optimal Value = 5. Problem 3 (30 points) Min. 30.95x11 + 31.10x12 + 30.90x13 + 32.30x21 + 31.80x23 + 31.55x31 + 31.55x32 + 32.15x33 s.t. x11 + x12 + x13 400 x21 + x23 600 x31 + x32 + x33 300 x11 + x21+ x31 =400 x12 + x32 =400 x13 + x23 + x33 =400 x ij 0 for all i,j . Optimal Plan: Martinsville to Chicago: 300 Martinsville to Dallas: 100 Plymouth to Chicago: 100 Plymouth to New York: 400 Franklin to Dallas: 300 Total Cost = $37,810 Note: Plymouth has excess supply of 100....
View Full Document
This note was uploaded on 11/18/2011 for the course BUS 220 taught by Professor Drexel during the Fall '08 term at SUNY Stony Brook.
- Fall '08