This preview shows page 1. Sign up to view the full content.
Unformatted text preview: Topic 1: Linear Programming ---Reference Solution Chapter 4 Q10 a) Let Xi be the number of cars of type i; where i=1 (Sedan), 2 (Hatchback), 3 (Minivan) Minimize Z = 12500 X1 + 8500X2 + 13700X3 Subject to: 10500 X1 + 9500 X2 + 12300 X3 = 2800000 (Note: In order to break even total revenue must equal total cost: 23,000 X1 + 18,000 X2 + 26,000 X3 = 12,500 X1+ 8,500 X2 + 13,700 X3 + 2,800,000 or 10,500 X1 + 9,500 X2 + 12,300 X3 = 2,800,000) X1 70 X2 50 X3 50 X1 120 X2 120 X3 120 X1, X2, X3 0 (non-negativity) (maximum amount of each car production) (minimum amount of each type of car) Q12 a) Let X1 be the number of gallons of Murphy's; X2 be the number of gallons of Blackton; X3 be the number of gallons of Red Rye; Maximize Z = 1.50 X1 + 1.60 X2 + 1.25 X3 Subject to: X1+X2+X3 = 1000 1.50X1 + 0.90X2 + 0.50X3 2000 X1 400 X2 500 X3 300 X1, X2, X3 0 (non-negativity) (maximum capacity to stock) (maximum budget for cider) (maximum customer demand for each type of cider) b) By using Lindo to solve the above problem, we get X1 = 400 X2 = 500 X3 = 100 Z = $1525.00 b) By using Lindo to solve the above problem, we get X1 = 70.00 X2 = 120.00 X3 = 75.203 Z = $2925284.553 ...
View Full Document
This note was uploaded on 06/17/2010 for the course MS 3401 taught by Professor Sally during the Spring '10 term at City University of Hong Kong.
- Spring '10