You are provided with the following linear program:
min z = 3x + y
s.t.
3x + 2y ≥ 6
− x + 2y ≤ 4
2x + y ≤ 10
x ≤ 4
x, y ≥ 0
(a) On the following page, use the graphical solution method to identify the feasible region.
(b) Find the feasible extreme points and calculate their objective values.
Extreme point 1:
Extreme point 2:
Extreme point 3:
Extreme point 4:
Extreme point 5:
(c) Draw an isocost line that passes through the point (x = 3, y = 0) and find the direction
of optimization.
(d) Provide the optimal solution and optimal objective value.
Optimal solution: x = y =
Optimal objective value