SOLVER7 Study. Nothing Else.
2024 Board Paper Q2

The maximum value of \(Z = 4x + y\) for an \(L.P.P.\) whose feasible region is given below is: (A)\(50\) (B)\(110\) (C)\(120\) (D)\(170\)

CBSE Class 12 Maths · Linear Programming

Solution

👶 Simple Explanation

Simple Explanation

Imagine you are checking a few special corner spots on a map to find the biggest score. The shaded area on the graph is like a playground, and the corners are the only spots worth checking. Each corner gets a score from the rule \( Z = 4x + y \). The corner \( O(0,0) \) scores 0, corner \( A(0,50) \) scores 50, corner \( B(20,30) \) scores 110, and corner \( C(30,0) \) scores 120. The highest score wins, so \( C(30,0) \) is the winner.

Answer: The maximum value of \( Z \) is \( 120 \), attained at \( C(30,0) \). Correct option is (C).

📖 Maximum Value of Z in an LPP

Detailed Explanation

In Linear Programming, the objective function \( Z = 4x + y \) is optimised (maximised or minimised) over a feasible region. A key result called the Corner Point Theorem states that if the feasible region is bounded, then the maximum and minimum values of the objective function always occur at one of the corner points (vertices) of the region. So instead of checking every point in the shaded region, we only need to evaluate \( Z \) at each corner and pick the largest value. From the graph, the shaded feasible region is a polygon with corner points \( O(0,0) \), \( A(0,50) \), \( B(20,30) \) and \( C(30,0) \).

Formula Used

By the Corner Point Method, evaluate \( Z = 4x + y \) at each corner point and choose the maximum value.

Solution

  1. Step 1: Identify all corner points of the feasible region from the graph. The shaded region is bounded by the axes and the constraint lines, giving corners \( O(0,0) \), \( A(0,50) \), \( B(20,30) \) and \( C(30,0) \).
  2. Step 2: Evaluate \( Z = 4x + y \) at \( O(0,0) \). \[ Z = 4(0) + 0 = 0 \]
  3. Step 3: Evaluate \( Z = 4x + y \) at \( A(0,50) \). \[ Z = 4(0) + 50 = 50 \]
  4. Step 4: Evaluate \( Z = 4x + y \) at \( B(20,30) \). \[ Z = 4(20) + 30 = 80 + 30 = 110 \]
  5. Step 5: Evaluate \( Z = 4x + y \) at \( C(30,0) \). \[ Z = 4(30) + 0 = 120 \]
  6. Step 6: Compare all the values: \( 0,\ 50,\ 110,\ 120 \). The largest value is \( 120 \), which occurs at the corner point \( C(30,0) \).

Final Answer

The maximum value of \( Z \) is \( 120 \), attained at \( C(30,0) \). Correct option is (C).

Common Mistake

A common mistake is to stop at point \( B(20,30) \) after getting \( Z = 110 \), assuming the interior-looking corner gives the maximum. You must evaluate \( Z \) at every corner point, including \( C(30,0) \), which actually gives the larger value \( 120 \).

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Read the corner points of the feasible region from the graph. The shaded polygon has four vertices: \( O(0,0) \), \( A(0,50) \), \( B(20,30) \), and \( C(30,0) \). — Reason: By the Corner Point Theorem, we only need to check these vertices; there is no need to test every point inside the region.
  2. Step 2: Evaluate \( Z = 4x + y \) at \( O(0,0) \): \[Z = 4(0) + 0 = 0\] — Reason: Substituting the coordinates of the origin gives the value of the objective function at this vertex.
  3. Step 3: Evaluate \( Z = 4x + y \) at \( A(0,50) \): \[Z = 4(0) + 50 = 50\] — Reason: Here \( x = 0 \) so the coefficient 4 contributes nothing, and only the \( y \)-value matters.
  4. Step 4: Evaluate \( Z = 4x + y \) at \( B(20,30) \): \[Z = 4(20) + 30 = 80 + 30 = 110\] — Reason: Both \( x \) and \( y \) are non-zero here, so both terms contribute to \( Z \).
  5. Step 5: Evaluate \( Z = 4x + y \) at \( C(30,0) \): \[Z = 4(30) + 0 = 120\] — Reason: Even though \( y = 0 \), the large \( x \)-value multiplied by the coefficient 4 produces the highest result so far.
  6. Step 6: Compare all computed values: \( Z = 0 \) at \( O \), \( Z = 50 \) at \( A \), \( Z = 110 \) at \( B \), and \( Z = 120 \) at \( C \). The largest among these is \( 120 \), occurring at \( C(30,0) \). — Reason: Comparing the values across all corners identifies the global maximum over the entire feasible region.

Final Answer

The maximum value of \( Z \) is \( 120 \), attained at \( C(30,0) \). Correct option is (C).

Common Mistake

One common mistake: Students sometimes skip one or more corner points (often the origin \( O \)) and miss checking all vertices, which can lead to an incorrect maximum value.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Corner points from the feasible region: \( O(0,0) \), \( A(0,50) \), \( B(20,30) \), \( C(30,0) \).
  2. Step 2: Evaluate \( Z = 4x + y \) at each corner: \( Z(O) = 0 \), \( Z(A) = 50 \), \( Z(B) = 4(20)+30 = 110 \), \( Z(C) = 4(30)+0 = 120 \).
  3. Step 3: Maximum value is \( 120 \) at \( C(30,0) \).

Answer: The maximum value of \( Z \) is \( 120 \), attained at \( C(30,0) \). Correct option is (C).

➕ More Examples

More Examples

Example 1

Question: The corner points of the feasible region of an LPP are \( A(0, 40) \), \( B(20, 40) \), \( C(60, 20) \), and \( D(60, 0) \). Find the maximum value of the objective function \( Z = 3x + 5y \).

Solution: We evaluate the objective function \( Z = 3x + 5y \) at each corner point of the feasible region. At \( A(0, 40) \): \[ Z = 3(0) + 5(40) = 0 + 200 = 200 \] At \( B(20, 40) \): \[ Z = 3(20) + 5(40) = 60 + 200 = 260 \] At \( C(60, 20) \): \[ Z = 3(60) + 5(20) = 180 + 100 = 280 \] At \( D(60, 0) \): \[ Z = 3(60) + 5(0) = 180 + 0 = 180 \] Comparing all values: \( 200, 260, 280, 180 \). The maximum value of \( Z \) is \( 280 \), attained at the corner point \( C(60, 20) \).

Answer: The maximum value of \( Z = 3x + 5y \) is \( 280 \) at the point \( C(60, 20) \).

Example 2

Question: The feasible region of an LPP has corner points \( P(0, 0) \), \( Q(0, 30) \), \( R(15, 30) \), \( S(30, 15) \), and \( T(30, 0) \). Find the maximum value of \( Z = 5x + 2y \).

Solution: We evaluate the objective function \( Z = 5x + 2y \) at each corner point of the feasible region. At \( P(0, 0) \): \[ Z = 5(0) + 2(0) = 0 \] At \( Q(0, 30) \): \[ Z = 5(0) + 2(30) = 0 + 60 = 60 \] At \( R(15, 30) \): \[ Z = 5(15) + 2(30) = 75 + 60 = 135 \] At \( S(30, 15) \): \[ Z = 5(30) + 2(15) = 150 + 30 = 180 \] At \( T(30, 0) \): \[ Z = 5(30) + 2(0) = 150 + 0 = 150 \] Comparing all values: \( 0, 60, 135, 180, 150 \). The maximum value of \( Z \) is \( 180 \), attained at the corner point \( S(30, 15) \).

Answer: The maximum value of \( Z = 5x + 2y \) is \( 180 \) at the point \( S(30, 15) \).

🎯 Try a Similar Question

Try a Similar Question

Question: The corner points of the feasible region of a Linear Programming Problem are \( A(0, 40) \), \( B(20, 40) \), \( C(40, 20) \), and \( D(0, 0) \). Find the maximum value of the objective function \( Z = 3x + 5y \). (A) 180 \quad (B) 200 \quad (C) 260 \quad (D) 220

Solution

  1. Step 1: Identify the Corner Points: The corner points of the feasible region are given as \( A(0, 40) \), \( B(20, 40) \), \( C(40, 20) \), and \( D(0, 0) \).
  2. Step 2: Evaluate Z at each Corner Point: The objective function is \( Z = 3x + 5y \). We substitute each corner point: At \( A(0, 40) \): \[ Z = 3(0) + 5(40) = 0 + 200 = 200 \] At \( B(20, 40) \): \[ Z = 3(20) + 5(40) = 60 + 200 = 260 \] At \( C(40, 20) \): \[ Z = 3(40) + 5(20) = 120 + 100 = 220 \] At \( D(0, 0) \): \[ Z = 3(0) + 5(0) = 0 \]
  3. Step 3: Compare the Values: The values of \( Z \) at the corner points are: \( 200 \), \( 260 \), \( 220 \), and \( 0 \). The largest value is \( 260 \), attained at \( B(20, 40) \).
  4. Step 4: State the Conclusion: Therefore, the maximum value of \( Z = 3x + 5y \) is \( 260 \), attained at the corner point \( B(20, 40) \). The correct option is (C).

Answer: The maximum value of \( Z \) is \( 260 \), attained at \( B(20, 40) \). Correct option is (C).

Everything you get with Solver7

More questions in Linear Programming