SOLVER7 Study. Nothing Else.
2023 Board Paper Q17

The corner points of the feasible region in the graphical representation of a linear programming problem are \((2, 72), (15, 20)\) and \((40, 15).\) If \(z = 18x + 9y\) be the objective function, then :
(A)\(z \) is maximum at \((2, 72),\) minimum at \((15, 20)\)
(B)\(z\) is maximum at \((15, 20),\) minimum at \((40, 15)\)
(C)\(z\) is maximum at \((40, 15),\) minimum at \((15, 20) \)
(D)\(z\) is maximum at \((40, 15),\) minimum at \((2, 72)\)

CBSE Class 12 Maths · Linear Programming

Solution

👶 Simple Explanation

Simple Explanation

Imagine a treasure hunt where clues are hidden only at certain corners of a map. You do not need to check every single spot — just the corners! Here, the corners are the points \( (2, 72) \), \( (15, 20) \), and \( (40, 15) \). We plug each corner into the rule \( z = 18x + 9y \) and get scores of \( 684 \), \( 450 \), and \( 855 \). The biggest score wins the maximum prize, and the smallest score marks the minimum. It is that simple!

Answer: \( z \) is maximum (value \( 855 \)) at \( (40, 15) \) and minimum (value \( 450 \)) at \( (15, 20) \). Hence the correct option is (C).

📖 Optimizing z = 18x + 9y over Corner Points

Detailed Explanation

In a Linear Programming Problem (LPP), the objective function \( z = ax + by \) attains its maximum and minimum values at the corner points (vertices) of the feasible region. This is guaranteed by the Corner Point Theorem. So instead of checking every point in the region, we only need to evaluate \( z \) at each corner point. The largest value gives the maximum and the smallest value gives the minimum. Here we are given three corner points and the objective function \( z = 18x + 9y \), so we simply substitute each point into \( z \) and compare.

Formula Used

\( z = 18x + 9y \), evaluated at each corner point; maximum is the largest \( z \), minimum is the smallest \( z \).

Solution

  1. Step 1: List the corner points given for the feasible region: \( (2, 72) \), \( (15, 20) \), and \( (40, 15) \). By the Corner Point Theorem, the optimal values of \( z \) occur at these points.
  2. Step 2: Evaluate \( z = 18x + 9y \) at the point \( (2, 72) \). \[ z = 18(2) + 9(72) \] \[ z = 36 + 648 = 684 \]
  3. Step 3: Evaluate \( z = 18x + 9y \) at the point \( (15, 20) \). \[ z = 18(15) + 9(20) \] \[ z = 270 + 180 = 450 \]
  4. Step 4: Evaluate \( z = 18x + 9y \) at the point \( (40, 15) \). \[ z = 18(40) + 9(15) \] \[ z = 720 + 135 = 855 \]
  5. Step 5: Compare the three values: \( 684 \), \( 450 \), and \( 855 \). The largest value is \( 855 \) at \( (40, 15) \), so \( z \) is maximum there. The smallest value is \( 450 \) at \( (15, 20) \), so \( z \) is minimum there.

Final Answer

\( z \) is maximum (value \( 855 \)) at \( (40, 15) \) and minimum (value \( 450 \)) at \( (15, 20) \). Hence the correct option is (C).

Common Mistake

A common mistake is to assume the maximum occurs at the point with the largest \( y \)-value (like \( (2, 72) \)) without actually calculating \( z \). Since the coefficient of \( x \) here is larger, you must substitute every corner point into \( z \) and compare the actual values.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the corner points of the feasible region. The three vertices given are \( (2, 72) \), \( (15, 20) \), and \( (40, 15) \). — Reason: By the Corner Point Theorem, we only need to check these vertices; the optimal values of \( z \) cannot occur at any interior point.
  2. Step 2: Substitute \( (2, 72) \) into \( z = 18x + 9y \): \[z = 18(2) + 9(72)\] \[z = 36 + 648 = 684\] — Reason: Computing \( z \) at the first vertex gives us one candidate value to compare against the others.
  3. Step 3: Substitute \( (15, 20) \) into \( z = 18x + 9y \): \[z = 18(15) + 9(20)\] \[z = 270 + 180 = 450\] — Reason: Computing \( z \) at the second vertex gives another candidate value; notice this is smaller than the value found in Step 2.
  4. Step 4: Substitute \( (40, 15) \) into \( z = 18x + 9y \): \[z = 18(40) + 9(15)\] \[z = 720 + 135 = 855\] — Reason: Computing \( z \) at the third vertex completes our table of candidate values.
  5. Step 5: Arrange the three values in order: \( 450 < 684 < 855 \). The largest value is \( 855 \), attained at \( (40, 15) \), and the smallest value is \( 450 \), attained at \( (15, 20) \). — Reason: Comparing all vertex values simultaneously lets us identify both the maximum and the minimum in a single scan.

Final Answer

\( z \) is maximum (value \( 855 \)) at \( (40, 15) \) and minimum (value \( 450 \)) at \( (15, 20) \). Hence the correct option is (C).

Common Mistake

One common mistake: Students sometimes confuse which corner point gives the maximum and which gives the minimum by only checking two of the three vertices and ignoring the third, leading to an incorrect identification of the optimal values.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: At \( (2, 72) \): \[ z = 18(2) + 9(72) = 36 + 648 = 684 \]
  2. Step 2: At \( (15, 20) \): \[ z = 18(15) + 9(20) = 270 + 180 = 450 \]
  3. Step 3: At \( (40, 15) \): \[ z = 18(40) + 9(15) = 720 + 135 = 855 \]
  4. Step 4: Comparing: \( 855 > 684 > 450 \), so maximum \( = 855 \) at \( (40, 15) \) and minimum \( = 450 \) at \( (15, 20) \).

Answer: \( z \) is maximum (value \( 855 \)) at \( (40, 15) \) and minimum (value \( 450 \)) at \( (15, 20) \). Hence the correct option is (C).

➕ More Examples

More Examples

Example 1

Question: The corner points of the feasible region of a linear programming problem are \( (0, 10) \), \( (5, 5) \), and \( (12, 0) \). If the objective function is \( z = 6x + 4y \), then which of the following is correct? (A) \( z \) is maximum at \( (0, 10) \), minimum at \( (12, 0) \) (B) \( z \) is maximum at \( (12, 0) \), minimum at \( (0, 10) \) (C) \( z \) is maximum at \( (12, 0) \), minimum at \( (5, 5) \) (D) \( z \) is maximum at \( (5, 5) \), minimum at \( (0, 10) \)

Solution: Evaluate the objective function \( z = 6x + 4y \) at each corner point. At \( (0, 10) \): \[ z = 6(0) + 4(10) = 0 + 40 = 40 \] At \( (5, 5) \): \[ z = 6(5) + 4(5) = 30 + 20 = 50 \] At \( (12, 0) \): \[ z = 6(12) + 4(0) = 72 + 0 = 72 \] Comparing the values: \( z = 40 \) at \( (0,10) \), \( z = 50 \) at \( (5,5) \), \( z = 72 \) at \( (12,0) \). The maximum value of \( z \) is \( 72 \) at \( (12, 0) \) and the minimum value of \( z \) is \( 40 \) at \( (0, 10) \). Hence, option (B) is correct.

Answer: (B) z is maximum at (12, 0), minimum at (0, 10)

Example 2

Question: The corner points of the feasible region determined by constraints of a linear programming problem are \( (3, 60) \), \( (20, 25) \), and \( (35, 10) \). If the objective function is \( z = 10x + 15y \), then which of the following is correct? (A) \( z \) is maximum at \( (3, 60) \), minimum at \( (35, 10) \) (B) \( z \) is maximum at \( (35, 10) \), minimum at \( (20, 25) \) (C) \( z \) is maximum at \( (20, 25) \), minimum at \( (35, 10) \) (D) \( z \) is maximum at \( (3, 60) \), minimum at \( (20, 25) \)

Solution: Evaluate the objective function \( z = 10x + 15y \) at each corner point. At \( (3, 60) \): \[ z = 10(3) + 15(60) = 30 + 900 = 930 \] At \( (20, 25) \): \[ z = 10(20) + 15(25) = 200 + 375 = 575 \] At \( (35, 10) \): \[ z = 10(35) + 15(10) = 350 + 150 = 500 \] Comparing the values: \( z = 930 \) at \( (3,60) \), \( z = 575 \) at \( (20,25) \), \( z = 500 \) at \( (35,10) \). The maximum value of \( z \) is \( 930 \) at \( (3, 60) \) and the minimum value of \( z \) is \( 500 \) at \( (35, 10) \). Hence, option (A) is correct.

Answer: (A) z is maximum at (3, 60), minimum at (35, 10)

🎯 Try a Similar Question

Try a Similar Question

Question: The corner points of the feasible region in the graphical representation of a linear programming problem are \( (5, 60) \), \( (20, 30) \), and \( (45, 10) \). If \( z = 12x + 6y \) is the objective function, then which of the following is correct? (A) \( z \) is maximum at \( (5, 60) \), minimum at \( (20, 30) \) (B) \( z \) is maximum at \( (45, 10) \), minimum at \( (5, 60) \) (C) \( z \) is maximum at \( (45, 10) \), minimum at \( (20, 30) \) (D) \( z \) is maximum at \( (20, 30) \), minimum at \( (5, 60) \)

Solution

  1. Step 1: Write down the objective function and corner points: The objective function is \( z = 12x + 6y \). The corner points of the feasible region are \( A = (5, 60) \), \( B = (20, 30) \), and \( C = (45, 10) \).
  2. Step 2: Evaluate z at corner point A = (5, 60): Substituting \( x = 5 \) and \( y = 60 \) into the objective function: \[ z_A = 12(5) + 6(60) = 60 + 360 = 420 \]
  3. Step 3: Evaluate z at corner point B = (20, 30): Substituting \( x = 20 \) and \( y = 30 \) into the objective function: \[ z_B = 12(20) + 6(30) = 240 + 180 = 420 \]
  4. Step 4: Evaluate z at corner point C = (45, 10): Substituting \( x = 45 \) and \( y = 10 \) into the objective function: \[ z_C = 12(45) + 6(10) = 540 + 60 = 600 \]
  5. Step 5: Compare all values to identify maximum and minimum: The computed values are \( z_A = 420 \), \( z_B = 420 \), and \( z_C = 600 \). The maximum value is \( 600 \) at \( C = (45, 10) \). The minimum value is \( 420 \), which occurs at both \( A = (5, 60) \) and \( B = (20, 30) \). Among the given options, option (B) states that \( z \) is maximum at \( (45, 10) \) and minimum at \( (5, 60) \), which is correct since \( z \) achieves its minimum value of \( 420 \) at \( (5, 60) \).

Answer: \( z \) is maximum (value \( 600 \)) at \( (45, 10) \) and minimum (value \( 420 \)) at \( (5, 60) \) (and also at \( (20, 30) \)). Hence the correct option is (B).

Everything you get with Solver7

More questions in Linear Programming