This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Homework 2 Due: February 3, 2009 Exercise 4, page 83 : Two different products, P1 and P2, can be manufactured by any of the two different machines, M1 and M2. The unit processing time of either product on either machine is the same. The total daily capacity of machine M1 is 200 units, while the total daily capacity of machine M2 is 250 units. The shop supervisor wants to balance the production schedule on the two machines such that the total number of units produced on one machine is within 5 units of the number produced on the other. The profit per unit of P1 is $10 and that of P2 is $15. Set up the problem as an LP in standard form. (This problem is a modification of) Exercise 5, page 83: Consider the following problem minimize z = max { x 1 x 2 + 3 x 3  ,   x 1 + 3 x 2 x 3 } subject to x 1 , x 2 , x 3 ≥ . Formulate the problem as an LP in standard form. Exercise 3, page 85 : ( Do not solve the problem, just provide formulation ) JoShop manufactures three products whose unit profits are $2, $5, and $3,...
View
Full Document
 Spring '09
 Nedich
 Optimization, Standard form, Basic Solutions, basic feasible solution, x1 unrestricted x2, total daily capacity

Click to edit the document details