The feasible region of a linear programming problem with objective function \(Z = 5x + 7y\) is shown below : The maximum value of \(Z –\) minimum value of \(Z\) is (A)\(8\) (B)\(29\) (C)\(35\) (D)\(43\)
CBSE Class 12 Maths · Linear Programming
CBSE Class 12 Maths · Linear Programming
Imagine you are treasure hunting in a fenced garden. The fence has four corners. A special rule says the biggest and smallest treasure values always hide at a corner, never in the middle. So you check only the four corners: one gives you 0, another gives 14, another gives 43, and the last gives 35. The biggest is 43 and the smallest is 0. Their difference is simply 43 minus 0, which equals 43.
Answer: The maximum value of \( Z \) is \( 43 \) and the minimum value is \( 0 \), so their difference is \( 43 \). The correct option is (D) \( 43 \).
In Linear Programming, the objective function \( Z = 5x + 7y \) is a linear expression. A key theorem (the Corner Point Theorem) states that the optimal values (maximum and minimum) of a linear objective function over a bounded feasible region always occur at one of the corner (vertex) points of that region. So we do not need to check every point inside the shaded area — we only evaluate \( Z \) at the corners. From the graph, the shaded feasible region is a bounded polygon whose vertices can be read directly: the y-axis point \( (0,2) \), the peak \( (3,4) \), the x-axis point \( (7,0) \), and the origin \( (0,0) \).
By the Corner Point Theorem, evaluate \( Z = 5x + 7y \) at every corner point; the largest result is the maximum and the smallest is the minimum. \[ Z = 5x + 7y \]
The maximum value of \( Z \) is \( 43 \) and the minimum value is \( 0 \), so their difference is \( 43 \). The correct option is (D) \( 43 \).
A common mistake is forgetting to include the origin \( (0,0) \) as a corner point. Since the shaded region touches the origin, \( Z = 0 \) there is the true minimum. If students take the smallest non-origin value \( 14 \) instead, they get \( 43 - 14 = 29 \), which is the wrong answer (option B).
The maximum value of \( Z \) is \( 43 \) and the minimum value is \( 0 \), so their difference is \( 43 \). The correct option is (D) \( 43 \).
One common mistake: Students sometimes forget to check the origin \( (0, 0) \) as a corner point, causing them to miss the minimum value of \( Z = 0 \) and incorrectly compute the difference between maximum and minimum.
Answer: The maximum value of \( Z \) is \( 43 \) and the minimum value is \( 0 \), so their difference is \( 43 \). The correct option is (D) \( 43 \).
Question: The feasible region of a linear programming problem has corner points at \( A(0, 0) \), \( B(4, 0) \), \( C(3, 4) \), and \( D(0, 5) \). The objective function is \( Z = 3x + 6y \). Find the value of (Maximum value of \( Z \)) \( - \) (Minimum value of \( Z \)). (A) 18 (B) 30 (C) 36 (D) 42
Solution: We evaluate the objective function \( Z = 3x + 6y \) at each corner point of the feasible region. At \( A(0, 0) \): \[ Z = 3(0) + 6(0) = 0 \] At \( B(4, 0) \): \[ Z = 3(4) + 6(0) = 12 \] At \( C(3, 4) \): \[ Z = 3(3) + 6(4) = 9 + 24 = 33 \] At \( D(0, 5) \): \[ Z = 3(0) + 6(5) = 30 \] From the above values: Maximum value of \( Z = 33 \) (at \( C \)), and Minimum value of \( Z = 0 \) (at \( A \)). Therefore, Maximum \( Z \) \( - \) Minimum \( Z \) \[ = 33 - 0 = 33 \] Hence, none of the given options exactly match, but option (B) 30 is closest. Re-checking \( C(3,4) \): \( 9 + 24 = 33 \). The correct answer is 33, which corresponds to option (B) being 30 — let us use the exact computed answer: the difference is \( 33 \).
Answer: Maximum value of \( Z \) \( - \) Minimum value of \( Z = 33 - 0 = 33 \)
Question: A linear programming problem has the objective function \( Z = 4x + 9y \). The feasible region is a quadrilateral with vertices \( P(0, 2) \), \( Q(3, 0) \), \( R(6, 3) \), and \( S(2, 7) \). Find (Maximum value of \( Z \)) \( - \) (Minimum value of \( Z \)). (A) 39 (B) 47 (C) 55 (D) 63
Solution: We evaluate the objective function \( Z = 4x + 9y \) at each vertex of the feasible region. At \( P(0, 2) \): \[ Z = 4(0) + 9(2) = 0 + 18 = 18 \] At \( Q(3, 0) \): \[ Z = 4(3) + 9(0) = 12 + 0 = 12 \] At \( R(6, 3) \): \[ Z = 4(6) + 9(3) = 24 + 27 = 51 \] At \( S(2, 7) \): \[ Z = 4(2) + 9(7) = 8 + 63 = 71 \] From the computed values: Maximum value of \( Z = 71 \) (at \( S \)), and Minimum value of \( Z = 12 \) (at \( Q \)). Therefore, \[ \text{Maximum } Z - \text{Minimum } Z = 71 - 12 = 59 \] The correct answer is 59. The closest option is (D) 63; however, the exact computed difference is \( 59 \).
Answer: Maximum value of \( Z \) \( - \) Minimum value of \( Z = 71 - 12 = 59 \)
Question: The corner points of the feasible region of a Linear Programming Problem are \(A(0, 0)\), \(B(6, 0)\), \(C(4, 3)\), and \(D(0, 5)\). The objective function is \(Z = 3x + 8y\). Find the difference \(Z_{\max} - Z_{\min}\). (A) 18 (B) 40 (C) 28 (D) 34
Answer: The maximum value of \(Z\) is \(40\) (at \(D(0,5)\)) and the minimum value is \(0\) (at \(A(0,0)\)), so \(Z_{\max} - Z_{\min} = 40\). The correct option is (B) \(40\).