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: , compatible with the model prod.mod . Then use AMPL to solve the problem. Print out your data le and AMPL output. 3. Consider the following linear program. maximize 9 x 1 + 8 x 2 subject to x 1x 2 2 3 x 1 + x 2 10 x 1 + 2 x 2 10 x 1 , x 2 . Find the optimal solution graphically. By adding together suitable multiples of the constraints, prove algebraically that your answer is indeed optimal. 1 4. For each of the following linear programs, decide graphically whether the problem is infeasible, unbounded, or has an optimal solution. Then explain algebraically why your answer is correct. (i) maximizex 2 subject to x 1 + x 2 1 x 1x 2 3 x 2 1 (ii) maximizex 2 subject to x 1 + x 2 1 x 1x 2 3 x 2 1 (iii) maximize x 2 subject to x 1 + x 2 1 x 1x 2 3 x 2 1 2...
View
Full
Document
 '08
 TODD

Click to edit the document details