Hands-On Tutorial N°3
Hands-On Tutorial N°3
Question 2:
Consider the following linear program:
Max Z= 3x1 + 2x2
Sbj x1 + x2 ≤ 3
x1 ≤2
-2x1 + x2 ≤ 1
x1 ≥ 0 , x2 ≥ 0
Question 3:
Consider the following linear program (P):
Max Z= C1x1 + C2x2
Sbj 2x1 + 5x2 ≥ 10
2x1 + 2x2 ≤ 10
-2x1 + 3x2 ≤ 0
x1 ≤5
x1 ≥ 0 , x2 ≥ 0
- Determine graphically the set of admissible solutions of (P). List the corners in this admissible
region.
- Use Graphic method to solve the model (P) in the case where c1 = 3 and c2 = 4: give an optimal
solution and the value of the objective function for this solution.
- Indicate how the answer to question (b) would be modified if the right-hand side of constraint
(2) moved from 10 to 12: Determine the admissible region of the modified model (P'), then
give the new optimal solution and the corresponding Z value.
- Graphically solve the model (P) in the case where c1 = 4 and c2 = 3.
- Indicate how the answer to the previous question would change if the right side of constraint
(2) went from 10 to 12.