SOLVER7 Study. Nothing Else.
2023 Board Paper Q14

The corner points of the feasible region of a linear programming problem are \((0, 4), (8, 0)\) and \(\left(\dfrac{20}{3},\dfrac{4}{3}\right).\) If \(Z = 30x + 24y\) is the objective function, then (maximum value of \(Z –\) minimum value of \(Z\)) is equal to : (A)\(40\) (B)\(96\) (C)\(120\) (D)\(136\)

CBSE Class 12 Maths · Linear Programming

Solution

👶 Simple Explanation

Simple Explanation

Imagine a treasure map with only three marked spots. The rule says the biggest and smallest prizes can only be found at those three spots. So we check each spot by plugging its numbers into the prize formula \( Z = 30x + 24y \). At spot \( (0,4) \) we get 96, at spot \( (8,0) \) we get 240, and at spot \( \left(\dfrac{20}{3}, \dfrac{4}{3}\right) \) we get 232. The biggest prize minus the smallest prize gives the answer.

Answer: Evaluating \( Z = 30x + 24y \): at \( (0,4) \), \( Z = 96 \); at \( (8,0) \), \( Z = 240 \); at \( \left(\dfrac{20}{3}, \dfrac{4}{3}\right) \), \( Z = 232 \). Maximum \( = 240 \), minimum \( = 96 \), so Max \( - \) Min \( = 240 - 96 = 144 \).

📖 Max minus Min of Z in Linear Programming

Detailed Explanation

In Linear Programming, the optimal (maximum or minimum) value of the objective function always occurs at one of the corner points (vertices) of the feasible region. This is known as the Corner Point Method. So instead of checking every point in the region, we only substitute each corner point into the objective function \( Z = 30x + 24y \). The largest value we obtain is the maximum, and the smallest is the minimum. Here we are given three corner points and asked to find the difference between the maximum and minimum values of \( Z \).

Formula Used

Objective function: \( Z = 30x + 24y \). By the Corner Point Method, evaluate \( Z \) at each corner point and compare.

Solution

  1. Step 1: List the given corner points of the feasible region: \( (0, 4) \), \( (8, 0) \), and \( \left(\dfrac{20}{3}, \dfrac{4}{3}\right) \). The objective function to be evaluated at each is \( Z = 30x + 24y \).
  2. Step 2: Evaluate \( Z \) at \( (0, 4) \): \[ Z = 30(0) + 24(4) = 0 + 96 = 96 \]
  3. Step 3: Evaluate \( Z \) at \( (8, 0) \): \[ Z = 30(8) + 24(0) = 240 + 0 = 240 \]
  4. Step 4: Evaluate \( Z \) at \( \left(\dfrac{20}{3}, \dfrac{4}{3}\right) \): \[ Z = 30\left(\dfrac{20}{3}\right) + 24\left(\dfrac{4}{3}\right) \] \[ Z = \dfrac{600}{3} + \dfrac{96}{3} = 200 + 32 = 232 \]
  5. Step 5: Compare all values: \( Z = 96 \), \( Z = 240 \), and \( Z = 232 \). The maximum value is \( 240 \) (at \( (8, 0) \)) and the minimum value is \( 96 \) (at \( (0, 4) \)).
  6. Step 6: Find the required difference: \[ \text{Max } Z - \text{Min } Z = 240 - 96 = 144 \] However, comparing with the options, the correct listed choice closest to the standard answer is obtained by verifying the arithmetic. Rechecking: maximum \( = 240 \), minimum \( = 96 \), so the difference is \( 144 \). Since \( 144 \) is not an option, we re-examine: the intended answer key gives \( 40 \) only if a different objective; but with \( Z = 30x + 24y \) the difference is \( 240 - 96 = 144 \).

Final Answer

Evaluating \( Z = 30x + 24y \): at \( (0,4) \), \( Z = 96 \); at \( (8,0) \), \( Z = 240 \); at \( \left(\dfrac{20}{3}, \dfrac{4}{3}\right) \), \( Z = 232 \). Maximum \( = 240 \), minimum \( = 96 \), so Max \( - \) Min \( = 240 - 96 = 144 \).

Common Mistake

A common mistake is forgetting to convert the fractional coordinate correctly, for example writing \( 30 \times \dfrac{20}{3} \) as \( 60 \) instead of \( 200 \). Always simplify carefully: \( \dfrac{30 \times 20}{3} = \dfrac{600}{3} = 200 \). Another mistake is stopping after finding only the maximum and forgetting to subtract the minimum.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the corner points: The three vertices of the feasible region are \( (0,\\ 4) \), \( (8,\\ 0) \), and \( \left(\dfrac{20}{3},\\ \dfrac{4}{3}\right) \). — Reason: These are the only points we need to check because, by the Corner Point Method, optimal values of a linear objective function always occur at vertices.
  2. Step 2: Evaluate Z at (0, 4): Substitute \( x = 0 \) and \( y = 4 \) into the objective function: \[Z = 30(0) + 24(4) = 0 + 96 = 96\] — Reason: We plug in the coordinates of the first corner point to find the value of \( Z \) there.
  3. Step 3: Evaluate Z at (8, 0): Substitute \( x = 8 \) and \( y = 0 \) into the objective function: \[Z = 30(8) + 24(0) = 240 + 0 = 240\] — Reason: We repeat the substitution for the second corner point to compare values.
  4. Step 4: Evaluate Z at the fractional corner point: Substitute \( x = \dfrac{20}{3} \) and \( y = \dfrac{4}{3} \) into the objective function: \[Z = 30\left(\dfrac{20}{3}\right) + 24\left(\dfrac{4}{3}\right) = \dfrac{600}{3} + \dfrac{96}{3} = 200 + 32 = 232\] — Reason: The third corner point is a fraction; careful arithmetic here avoids a common calculation error.
  5. Step 5: Identify the maximum and minimum: Comparing the three results — \( Z = 96 \) at \( (0,4) \), \( Z = 240 \) at \( (8,0) \), and \( Z = 232 \) at \( \left(\dfrac{20}{3}, \dfrac{4}{3}\right) \) — the largest value is \( 240 \) and the smallest value is \( 96 \). — Reason: We arrange the computed values in order to clearly pick out the maximum and minimum.
  6. Step 6: Compute the required difference: Subtract the minimum from the maximum: \[\text{Max} - \text{Min} = 240 - 96 = 144\] — Reason: The question asks for the difference between the maximum and minimum values of \( Z \), which is exactly what this subtraction gives.

Final Answer

Evaluating \( Z = 30x + 24y \): at \( (0,4) \), \( Z = 96 \); at \( (8,0) \), \( Z = 240 \); at \( \left(\dfrac{20}{3}, \dfrac{4}{3}\right) \), \( Z = 232 \). Maximum \( = 240 \), minimum \( = 96 \), so Max \( - \) Min \( = 240 - 96 = 144 \).

Common Mistake

One common mistake: students sometimes forget to evaluate Z at the fractional corner point \( \left(\dfrac{20}{3}, \dfrac{4}{3}\right) \), assuming only integer-coordinate vertices matter — but every listed corner point must be checked, regardless of whether its coordinates are whole numbers or fractions.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: At \( (0, 4) \): \[ Z = 30(0) + 24(4) = 96 \]
  2. Step 2: At \( (8, 0) \): \[ Z = 30(8) + 24(0) = 240 \]
  3. Step 3: At \( \left(\dfrac{20}{3}, \dfrac{4}{3}\right) \): \[ Z = 30\left(\dfrac{20}{3}\right) + 24\left(\dfrac{4}{3}\right) = 200 + 32 = 232 \]
  4. Step 4: Maximum \( = 240 \), Minimum \( = 96 \), so \[ \text{Max} - \text{Min} = 240 - 96 = 144 \]

Answer: Evaluating \( Z = 30x + 24y \): at \( (0,4) \), \( Z = 96 \); at \( (8,0) \), \( Z = 240 \); at \( \left(\dfrac{20}{3}, \dfrac{4}{3}\right) \), \( Z = 232 \). Maximum \( = 240 \), minimum \( = 96 \), so Max \( - \) Min \( = 240 - 96 = 144 \).

➕ More Examples

More Examples

Example 1

Question: The corner points of the feasible region of a linear programming problem are \( (0, 6) \), \( (10, 0) \), and \( \left(\dfrac{15}{2}, \dfrac{5}{2}\right) \). If the objective function is \( Z = 20x + 36y \), find (maximum value of \( Z \) − minimum value of \( Z \)).

Solution: We evaluate \( Z = 20x + 36y \) at each corner point of the feasible region. At \( (0, 6) \): \[ Z = 20(0) + 36(6) = 0 + 216 = 216 \] At \( (10, 0) \): \[ Z = 20(10) + 36(0) = 200 + 0 = 200 \] At \( \left(\dfrac{15}{2}, \dfrac{5}{2}\right) \): \[ Z = 20 \times \frac{15}{2} + 36 \times \frac{5}{2} = 150 + 90 = 240 \] So the values of \( Z \) at the corner points are \( 216 \), \( 200 \), and \( 240 \). Maximum value of \( Z = 240 \) (at \( \left(\dfrac{15}{2}, \dfrac{5}{2}\right) \)). Minimum value of \( Z = 200 \) (at \( (10, 0) \)). Therefore, maximum \( Z \) − minimum \( Z \): \[ 240 - 200 = 40 \]

Answer: 40

Example 2

Question: The vertices of the feasible region of a linear programming problem are \( (0, 10) \), \( (12, 0) \), and \( \left(4, \dfrac{16}{3}\right) \). The objective function is \( Z = 15x + 18y \). Find (maximum value of \( Z \) − minimum value of \( Z \)).

Solution: We evaluate \( Z = 15x + 18y \) at each corner point. At \( (0, 10) \): \[ Z = 15(0) + 18(10) = 0 + 180 = 180 \] At \( (12, 0) \): \[ Z = 15(12) + 18(0) = 180 + 0 = 180 \] At \( \left(4, \dfrac{16}{3}\right) \): \[ Z = 15(4) + 18 \times \frac{16}{3} = 60 + 96 = 156 \] So the values of \( Z \) at the corner points are \( 180 \), \( 180 \), and \( 156 \). Maximum value of \( Z = 180 \) (at both \( (0,10) \) and \( (12, 0) \)). Minimum value of \( Z = 156 \) (at \( \left(4, \dfrac{16}{3}\right) \)). Therefore, maximum \( Z \) − minimum \( Z \): \[ 180 - 156 = 24 \]

Answer: 24

🎯 Try a Similar Question

Try a Similar Question

Question: The corner points of the feasible region of a linear programming problem are \( (0, 6) \), \( (10, 0) \), and \( \left(\dfrac{15}{2}, \dfrac{5}{2}\right) \). If \( Z = 20x + 30y \) is the objective function, then the value of (maximum value of \( Z \) - minimum value of \( Z \)) is: (A) 50 (B) 80 (C) 100 (D) 120

Solution

  1. Step 1: Identify the Corner Points: The corner points of the feasible region are \( A = (0, 6) \), \( B = (10, 0) \), and \( C = \left(\dfrac{15}{2}, \dfrac{5}{2}\right) \).
  2. Step 2: Evaluate Z at each Corner Point: The objective function is \( Z = 20x + 30y \). Evaluate at each corner point.
  3. Step 3: Z at Point A = (0, 6): Substituting \( x = 0 \) and \( y = 6 \): \[ Z_A = 20(0) + 30(6) = 0 + 180 = 180 \]
  4. Step 4: Z at Point B = (10, 0): Substituting \( x = 10 \) and \( y = 0 \): \[ Z_B = 20(10) + 30(0) = 200 + 0 = 200 \]
  5. Step 5: Z at Point C = (15/2, 5/2): Substituting \( x = \dfrac{15}{2} \) and \( y = \dfrac{5}{2} \): \[ Z_C = 20 \times \dfrac{15}{2} + 30 \times \dfrac{5}{2} = 150 + 75 = 225 \]
  6. Step 6: Identify Maximum and Minimum Values: Comparing the values: \( Z_A = 180 \), \( Z_B = 200 \), \( Z_C = 225 \). Therefore, the maximum value of \( Z \) is \( 225 \) (at point \( C \)) and the minimum value of \( Z \) is \( 180 \) (at point \( A \)).
  7. Step 7: Compute the Required Difference: The required value is: \[ Z_{\max} - Z_{\min} = 225 - 180 = 45 \] Wait — let me recheck. \( Z_A = 180 \), \( Z_B = 200 \), \( Z_C = 225 \). So: \[ Z_{\max} - Z_{\min} = 225 - 180 = 45 \] Hmm, this does not match the options. Re-evaluating \( Z_B \): \( 20 \times 10 = 200 \). The minimum is \( Z_A = 180 \) and maximum is \( Z_C = 225 \), so \( Z_{\max} - Z_{\min} = 225 - 180 = 45 \). The correct answer is \( 45 \), which confirms option (A) should read 45. The answer is \( \boxed{45} \).

Answer: The maximum value of \( Z \) is \( 225 \) (at \( \left(\dfrac{15}{2}, \dfrac{5}{2}\right) \)) and the minimum value is \( 180 \) (at \( (0,6) \)). Therefore, \( Z_{\max} - Z_{\min} = 225 - 180 = 45 \).

Everything you get with Solver7

More questions in Linear Programming