ENG M 540 Assignment #1

Solutions - posted 22 September 2011

Chapter 3.2, Problem 1 (page 63): Line EF is 4x1 + 10x2 = 40, CD is x1 = 3, and AB is x1 + x2 = 7. The feasible region is bounded by ACGH. The dotted line in graph is the isoprofit line corresponding to 30x1 + 100x2 = 120. Point G is optimal. At G the constraints 10x1 30 and 4x1 + 10x2 40 are binding. Thus the optimal solution has x1 = 3, x2 = 2.8 and z = 30(3) + 100(2.8) = 370.

Chapter 3.2, Problem 3 (page 63): Decisions variables: x1 = Number of hours of Process 1 x2 = Number of hours of Process 2. The appropriate LP is: Objective: Subject to min z = 4x1 + x2 3x1 + x2 10 (A constraint) x1 + x2 5 (B constraint) x1 3 (C constraint) x1, x2 0

AB is 3x1 + x2 = 10. CD is x1 + x2 = 5. EF is x1 = 3. The feasible region is shaded. Dotted line is isocost line 4x1 + x2 = 24. Moving the isocost line down and to the left we see that H (where the AB and CD constraints intersect) is optimal. Thus the optimal solution to the LP is x1 = 3, x2 = 2, z = 4(3) + 2 = $14.

Chapter 3.2, Problem 5 (page 63): Decisions variables: x1 = desks produced x2 = chairs produced. The appropriate LP is: Objective: Subject to: max z = 40x1 + 25x2 -2x1 + x2 0 4x1 + 3x2 20 x1, x2 0

Graphically we find the optimal solution to be x1 = 2, x2 = 4 and z = 180.

Chapter 3.3, Problem 1 (page 68): AB is x1 + x2 = 4. CD is x1 - x2 = 5. From the graph we see that there is no feasible solution (case 3).

Chapter 3.3, Problem 2 (page 68): AB is 8x1 + 2x2 = 16. CD is 5x1 + 2x2 = 12. The dotted line is the isoprofit line corresponding to z = 4x1 + x2 = 4. The feasible region is bounded by AEDF. Since the isoprofit line is parallel to AB, then the entire line segment of AE (the portion of AB that is part of the feasible region) is optimal. Thus we have alternative or multiple optimal solutions (case 2).

Chapter 3.3, Problem 3 (page 68): AB is x1 - x2 = 4. AC is x1 + 2x2 = 4. The feasible region is bounded by AC and infinite line segment AB. The dotted line is the isoprofit line for z = 0. To increase z we move parallel to isoprofit line in an upward direction (and to the left). We will never entirely lose contact with the feasible region, so we have an unbounded LP (case 4).

Chapter 3.3, Problem 4 (page 68): AB is 2x1 + x2 = 6. CD is x1 + 3x2 = 9. The feasible region is bounded by AECF. The dotted line is 3 = 3x1 + x2. Moving up and to right (and parallel to the isoprofit line) we find that point A is uniquely optimal (case 1). A is where constraints 2x1 + x2 6 and x2 0 are binding. Thus, the optimal solution to the LP is x1 = 3, x2 = 0, z = 9.

Chapter 3.3, Problem 10 (page 68): Decisions variables: x1 = dollars bought (for francs) x2 = francs bought (for dollars).

The appropriate LP is: Objective: Subject to: max z = x1 - .25x2 x1 - .25x2 0 -3x1 + x2 0 x1, x2 0

(dollar constraint) (franc constraint)

In the graph below, the LP's feasible region is between the lines indicated by segments AB and AC. Isoprofit lines are parallel to AB. We increase z by moving down and to the right. Since AB has a larger slope than AC, we will have an unbounded LP.

(b) The infeasibility is due to the inconsistency in the exchange rate in the francs-dollars market. Of course, such an inconsistency in the currency markets would quickly be corrected before you could make an infinite amount of money!