Question

Solve the following linear program graphically (each line represents one unit). The feasible region is indicated by the shading and the corner points have been listed for you. Determine the objective function value at the corner points and indicate the optimal solution (if any). Minimize: Z

Answer 1

(a): The value of the objective function at the corner points

`Z = 10`

`Z = 19`

`Z = 15`

(b) The optimal solution is
`(6,2)`

Step-by-step explanation:

Given

`Min\ Z = X_1 + 2X_2`

Subject to:

`-2X_1 + 5X_2 \ge -2` ---- 1

`X_1 + 4X_2 \le 27` ---- 2

`8X_1 + 5X_2 \ge 58` --- 3

Solving (a): The value of the at the corner points

From the graph, the corner points are:

`(6,2)\ \ \ \ \ \ (11,4)\ \ \ \ \ \ \ \ (3,6)`

So, we have:

`(6,2)` ------- Corner point 1

`Min\ Z = X_1 + 2X_2`

`Z = 6 + 2 * 2`

`Z = 6 + 4`

`Z = 10`

`(11,4)` ------ Corner point 2

`Min\ Z = X_1 + 2X_2`

`Z = 11 + 2 * 4`

`Z = 11 + 8`

`Z = 19`

`(3,6)` --- Corner point 3

`Min\ Z = X_1 + 2X_2`

`Z = 3 + 2 * 6`

`Z = 3 + 12`

`Z = 15`

Solving (b): The optimal solution

Since we are to minimize Z, the optimal solution is at the corner point that gives the least value

In (a), the least value of Z is:
`Z = 10`

So, the optimal solution is at: corner point 1

`(6,2)`