A linear programming problem is as follows:
Maximize/minimize objective function \(z = 2x-y+5\) subject to constraints.
\(3x+4y \le 60,\ x+3y \le 30,\ x \ge 0,\ y \ge 0\).
If the corner points of feasible region are A(0, 10) B(12, 6) C(20, 0) 0(0, 0), then which of the following is true.
Answer & explanation
Correct answer: option 2
The correct answer is Option (2) → Minimum value of z is −5
By the corner point method, the maximum and minimum of z over the feasible region occur at corner points. The last corner, printed 0(0, 0), is the origin O(0, 0).
Values of z = 2x − y + 5 at the corners:
\(A(0, 10):\ z = 0 - 10 + 5 = -5\)
\(B(12, 6):\ z = 24 - 6 + 5 = 23\)
\(C(20, 0):\ z = 40 - 0 + 5 = 45\)
\(O(0, 0):\ z = 0 - 0 + 5 = 5\)
So the maximum of z is 45 (at C), the minimum is −5 (at A), and the four corner values are all different.
Checking the options
Option (1) Maximum value of z is 40 — Incorrect. The maximum is 45, at C(20, 0).
Option (2) Minimum value of z is −5 — Correct. The least corner value is −5, at A(0, 10).
Option (3) Difference of maximum and minimum values of z is 35 — Incorrect. The difference is 45 − (−5) = 50.
Option (4) At two corner points value of z are equal — Incorrect. The values −5, 23, 45 and 5 are all different.