SOLVER7 Study. Nothing Else.
2024 Board Paper Q37(ii)

The month of September is celebrated as the Rashtriya Poshan Maah across the country. Following a healthy and well-balanced diet is crucial in order to supply the body with the proper nutrients it needs. A balanced diet also keeps us mentally fit and promotes improved level of energy. A dietician wishes to minimize the cost of a diet involving two types of foods, food \(X (x\ kg)\) and food \(Y (y\ kg)\) which are available at the rate of ₹\( 16/kg\) and ₹\( 20/kg\) respectively. The feasible region satisfying the constraints is shown in Figure-2. On the basis of the above information, answer the following questions :If the objective is to minimize cost \(Z = 16x + 20y,\) find the values of \(x\) and \(y\) at which cost is minimum. Also, find minimum cost assuming that minimum cost is possible for the given unbounded region.

CBSE Class 12 Maths · Linear Programming

Solution

👶 Simple Explanation

Simple Explanation

Imagine you are shopping for two foods, and you want to spend as little money as possible. There are only a few special corner points where the cheapest option can hide. We check the price at each corner, like peeking at price tags. The smallest price tag wins, but we also double-check that no sneaky cheaper option is hiding elsewhere. At the corner point where \(x = 2\) kg and \(y = 4\) kg, the total cost turns out to be the lowest of all.

Answer: The cost is minimum at \(x = 2\) kg and \(y = 4\) kg, and the minimum cost is \[Z = 16(2) + 20(4) = ₹112\]

📖 Minimizing Cost in an Unbounded LPP

Detailed Explanation

This is a Linear Programming Problem (LPP). We want to minimize an objective function \(Z = 16x + 20y\) over a feasible region. From Figure-2, the feasible region is unbounded (it extends without limit towards the upper right), and its boundary corner points are given as \(D(0, 8)\), \(C(1, 5)\), \(B(2, 4)\) and \(A(10, 0)\). For a bounded region, the optimum of a linear objective function always occurs at a corner point. For an UNBOUNDED region, the minimum still occurs at a corner point, BUT we must verify that the value is actually the minimum. We do this by checking whether the open half-plane \(16x + 20y < Z_{min}\) has any point common with the feasible region. If it has no common point, the corner value is confirmed as the true minimum.

Formula Used

Corner Point Method: evaluate \(Z = 16x + 20y\) at each corner point; for an unbounded region the least value is the minimum only if \(16x + 20y < Z_{min}\) has no point in the feasible region.

Solution

  1. Step 1: List the corner points of the feasible region as read from Figure-2: \(A(10, 0)\), \(B(2, 4)\), \(C(1, 5)\) and \(D(0, 8)\). These are the vertices where the boundary lines of the feasible region meet.
  2. Step 2: Evaluate \(Z = 16x + 20y\) at each corner point. At \(A(10, 0)\): \[Z = 16(10) + 20(0) = 160\] At \(B(2, 4)\): \[Z = 16(2) + 20(4) = 32 + 80 = 112\]
  3. Step 3: Continue evaluating. At \(C(1, 5)\): \[Z = 16(1) + 20(5) = 16 + 100 = 116\] At \(D(0, 8)\): \[Z = 16(0) + 20(8) = 160\]
  4. Step 4: Compare the values: \(Z(A) = 160\), \(Z(B) = 112\), \(Z(C) = 116\), \(Z(D) = 160\). The smallest value is \(112\), occurring at the point \(B(2, 4)\).
  5. Step 5: Since the region is unbounded, we must confirm this is truly the minimum. Consider the open half-plane \[16x + 20y < 112\] We check whether it has any point in common with the feasible region. Because the feasible region lies on or above these constraint lines and extends towards increasing \(x, y\), the line \(16x + 20y = 112\) touches the region only at \(B\) and no point of the region satisfies \(16x + 20y < 112\). Hence the minimum is confirmed.
  6. Step 6: Therefore the cost is minimum at \(x = 2\) and \(y = 4\), giving minimum cost \(Z = 112\).

Final Answer

The cost is minimum at \(x = 2\) kg and \(y = 4\) kg, and the minimum cost is \[Z = 16(2) + 20(4) = ₹112\]

Common Mistake

A common mistake is to declare the least corner value as the minimum without checking the open half-plane \(16x + 20y < 112\) for an unbounded region. For unbounded regions you must verify that this half-plane has no point in common with the feasible region before concluding the minimum exists.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Read off the four corner points of the feasible region from Figure-2: \(A(10,\,0)\), \(B(2,\,4)\), \(C(1,\,5)\), and \(D(0,\,8)\). — Reason: The Corner Point Method requires us to identify every vertex of the feasible region before computing anything, because the optimal value of a linear objective function can only occur at one of these vertices.
  2. Step 2: Evaluate \(Z = 16x + 20y\) at \(A(10,\,0)\): \[Z_A = 16(10) + 20(0) = 160 + 0 = 160\] and at \(B(2,\,4)\): \[Z_B = 16(2) + 20(4) = 32 + 80 = 112\] — Reason: Substituting each corner point directly into the objective function gives us the cost at that production level, allowing comparison across all vertices.
  3. Step 3: Evaluate \(Z\) at \(C(1,\,5)\): \[Z_C = 16(1) + 20(5) = 16 + 100 = 116\] and at \(D(0,\,8)\): \[Z_D = 16(0) + 20(8) = 0 + 160 = 160\] — Reason: Completing the evaluation for all remaining vertices ensures no corner point is overlooked.
  4. Step 4: Compare all four values: \(Z_A = 160\), \(Z_B = 112\), \(Z_C = 116\), \(Z_D = 160\). The smallest is \(Z_B = 112\) at \(B(2,\,4)\). — Reason: Direct comparison immediately identifies the candidate minimum; without comparing all values, we might incorrectly choose a non-optimal corner.
  5. Step 5: Because the feasible region is unbounded, we must verify that \(Z = 112\) is a true minimum and not just a local one. Form the open half-plane \(16x + 20y < 112\), i.e. \(4x + 5y < 28\), and check whether it has any point in common with the feasible region. Plotting (or testing) shows this half-plane does NOT intersect the feasible region. — Reason: An unbounded feasible region could theoretically contain points with \(Z\) values smaller than the corner minimum; this verification step rules that out, confirming \(Z = 112\) is the global minimum.

Final Answer

The cost is minimum at \(x = 2\) kg and \(y = 4\) kg, and the minimum cost is \[Z = 16(2) + 20(4) = ₹112\]

Common Mistake

One common mistake: Students often stop after finding the smallest corner-point value without performing the unbounded-region verification. For an unbounded feasible region, this verification (checking that the half-plane \(16x + 20y < Z_{\min}\) does not intersect the feasible region) is mandatory — skipping it can lead to incorrectly declaring a minimum that does not actually exist.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Corner points from Figure-2: \(A(10,0)\), \(B(2,4)\), \(C(1,5)\), \(D(0,8)\).
  2. Step 2: Evaluate \(Z\) at each corner: \[Z_A = 16(10)+20(0)=160, \quad Z_B = 16(2)+20(4)=112, \quad Z_C = 16(1)+20(5)=116, \quad Z_D = 16(0)+20(8)=160\]
  3. Step 3: Smallest value is \(Z = 112\) at \(B(2,4)\). Since the region is unbounded, verify: \(16x + 20y < 112\) has no point in the feasible region, confirming the minimum.

Answer: The cost is minimum at \(x = 2\) kg and \(y = 4\) kg, and the minimum cost is \[Z = 16(2) + 20(4) = ₹112\]

➕ More Examples

More Examples

Example 1

Question: A school canteen wishes to minimize the cost of preparing a snack mix using two ingredients, ingredient A (x kg) and ingredient B (y kg), available at ₹18/kg and ₹12/kg respectively. The constraints based on nutritional requirements are: \[2x + y \ge 8\] \[x + 2y \ge 10\] \[x \ge 0, \quad y \ge 0\] The feasible region is unbounded. The corner points of the feasible region are \((0, 8)\), \((2, 4)\), and \((10, 0)\). Minimize the cost \(Z = 18x + 12y\) and find the values of \(x\) and \(y\) at which the minimum cost occurs. Also verify that the minimum is valid for the unbounded region.

Solution: The objective function to minimize is \(Z = 18x + 12y\). Step 1: Identify the corner points of the feasible region. The corner points are \((0, 8)\), \((2, 4)\), and \((10, 0)\). Step 2: Find the intersection point \((2, 4)\). Solving \(2x + y = 8\) and \(x + 2y = 10\) simultaneously: From the first equation: \(y = 8 - 2x\). Substituting into the second: \(x + 2(8 - 2x) = 10\), which gives \(x + 16 - 4x = 10\), so \(-3x = -6\), hence \(x = 2\) and \(y = 8 - 4 = 4\). So the intersection point is \((2, 4)\), confirmed. Step 3: Evaluate \(Z\) at each corner point. At \((0, 8)\): \[Z = 18(0) + 12(8) = 0 + 96 = 96\] At \((2, 4)\): \[Z = 18(2) + 12(4) = 36 + 48 = 84\] At \((10, 0)\): \[Z = 18(10) + 12(0) = 180 + 0 = 180\] Step 4: Identify the minimum. The minimum value of \(Z\) is \(84\), occurring at \((2, 4)\). Step 5: Verify for the unbounded region. Since the feasible region is unbounded, we must check whether there exists a point in the feasible region satisfying \(18x + 12y < 84\). Consider the half-plane \(18x + 12y < 84\), i.e., \(3x + 2y < 14\). Check if the feasible region and the open half-plane \(3x + 2y < 14\) have a common point. The line \(3x + 2y = 14\) does NOT pass through any point of the feasible region that lies below this line (all feasible points satisfy \(2x + y \ge 8\) and \(x + 2y \ge 10\), and any point in the feasible region gives \(Z \ge 84\)). Hence the minimum is valid. Therefore, the minimum cost is ₹84, achieved at \(x = 2\) kg and \(y = 4\) kg.

Answer: Minimum cost \(Z = \) ₹84 at \(x = 2\) kg and \(y = 4\) kg.

Example 2

Question: A farmer wants to minimize the cost of fertilizing a field using two types of fertilizers, type P (x bags) and type Q (y bags), costing ₹30 per bag and ₹24 per bag respectively. The soil requirements lead to the following constraints: \[x + 3y \ge 6\] \[3x + y \ge 6\] \[x \ge 0, \quad y \ge 0\] The feasible region is unbounded. The corner points of the feasible region are \((0, 6)\), \((\frac{3}{2}, \frac{3}{2})\), and \((6, 0)\). Minimize the cost \(Z = 30x + 24y\) and find the values of \(x\) and \(y\) at which the minimum cost occurs. Also verify that the minimum is valid for the unbounded region.

Solution: The objective function to minimize is \(Z = 30x + 24y\). Step 1: Identify the corner points of the feasible region. The corner points are \((0, 6)\), \(\left(\frac{3}{2}, \frac{3}{2}\right)\), and \((6, 0)\). Step 2: Find the intersection point \(\left(\frac{3}{2}, \frac{3}{2}\right)\). Solving \(x + 3y = 6\) and \(3x + y = 6\) simultaneously: Adding both equations: \(4x + 4y = 12\), so \(x + y = 3\). Subtracting the first from the second: \(2x - 2y = 0\), so \(x = y\). Therefore \(x + x = 3\) gives \(x = \frac{3}{2}\) and \(y = \frac{3}{2}\). The intersection point is \(\left(\frac{3}{2}, \frac{3}{2}\right)\), confirmed. Step 3: Evaluate \(Z\) at each corner point. At \((0, 6)\): \[Z = 30(0) + 24(6) = 0 + 144 = 144\] At \(\left(\frac{3}{2}, \frac{3}{2}\right)\): \[Z = 30 \times \frac{3}{2} + 24 \times \frac{3}{2} = 45 + 36 = 81\] At \((6, 0)\): \[Z = 30(6) + 24(0) = 180 + 0 = 180\] Step 4: Identify the minimum. The minimum value of \(Z\) is \(81\), occurring at \(\left(\frac{3}{2}, \frac{3}{2}\right)\). Step 5: Verify for the unbounded region. Since the feasible region is unbounded, we check whether the open half-plane \(30x + 24y < 81\), i.e., \(10x + 8y < 27\), has any point in common with the feasible region. The line \(10x + 8y = 27\) lies entirely below the feasible region (all feasible points satisfy \(x + 3y \ge 6\) and \(3x + y \ge 6\), and no feasible point gives \(Z < 81\)). Hence the minimum is valid. Therefore, the minimum cost is ₹81, achieved at \(x = \frac{3}{2}\) bags and \(y = \frac{3}{2}\) bags.

Answer: Minimum cost \(Z = \) ₹81 at \(x = \frac{3}{2}\) bags and \(y = \frac{3}{2}\) bags.

🎯 Try a Similar Question

Try a Similar Question

Question: During National Nutrition Month, a health consultant wants to design a low-cost meal plan using two food items, Food A (\( x \) kg) and Food B (\( y \) kg), available at ₹18/kg and ₹24/kg respectively. The constraints based on nutritional requirements are: \[ x + y \ge 6 \] \[ 2x + y \ge 8 \] \[ x \ge 0, \quad y \ge 0 \] The feasible region satisfying these constraints is unbounded (above and to the right). The corner points of the feasible region are \( (0, 8) \), \( (2, 4) \), and \( (6, 0) \). If the objective is to minimize cost \( Z = 18x + 24y \), find the values of \( x \) and \( y \) at which the cost is minimum. Also find the minimum cost, confirming that it is indeed minimum for the given unbounded region.

Solution

  1. Step 1: Identify the Corner Points of the Feasible Region: The constraints are \( x + y \ge 6 \), \( 2x + y \ge 8 \), \( x \ge 0 \), \( y \ge 0 \). The feasible region is unbounded (extends away from the origin). The corner points are found by solving pairs of boundary equations. Intersection of \( x + y = 6 \) and \( 2x + y = 8 \): Subtracting the first from the second gives \( x = 2 \), so \( y = 4 \). Corner point: \( (2, 4) \). Intersection of \( 2x + y = 8 \) with the \( y \)-axis (\( x = 0 \)): \( y = 8 \). Corner point: \( (0, 8) \). Intersection of \( x + y = 6 \) with the \( x \)-axis (\( y = 0 \)): \( x = 6 \). Corner point: \( (6, 0) \).
  2. Step 2: Evaluate the Objective Function at Each Corner Point: The objective function is \( Z = 18x + 24y \). At \( (0, 8) \): \[ Z = 18(0) + 24(8) = 0 + 192 = 192 \] At \( (2, 4) \): \[ Z = 18(2) + 24(4) = 36 + 96 = 132 \] At \( (6, 0) \): \[ Z = 18(6) + 24(0) = 108 + 0 = 108 \]
  3. Step 3: Identify the Tentative Minimum: Comparing the values: \( Z = 192 \) at \( (0, 8) \), \( Z = 132 \) at \( (2, 4) \), and \( Z = 108 \) at \( (6, 0) \). The smallest value is \( Z = 108 \) at the corner point \( (6, 0) \).
  4. Step 4: Confirm the Minimum for the Unbounded Region: Since the feasible region is unbounded, we must verify that \( Z = 108 \) is truly the minimum. We check whether the open half-plane \( 18x + 24y < 108 \) has any common point with the feasible region. Simplify: \( 18x + 24y < 108 \) becomes \( 3x + 4y < 18 \). Check whether any point satisfying both \( x + y \ge 6 \), \( 2x + y \ge 8 \) also satisfies \( 3x + 4y < 18 \). Testing \( (6, 0) \): \( 3(6) + 4(0) = 18 \), which is not strictly less than 18. Testing a nearby feasible point such as \( (7, 0) \): \( 3(7) + 4(0) = 21 > 18 \). No feasible point satisfies \( 3x + 4y < 18 \), so the open half-plane has no common point with the feasible region.
  5. Step 5: State the Final Answer: Since the open half-plane \( 18x + 24y < 108 \) has no point in common with the feasible region, the minimum is confirmed. The cost is minimum at \( x = 6 \) kg and \( y = 0 \) kg, and the minimum cost is \[ Z = 18(6) + 24(0) = \text{₹}108 \]

Answer: The cost is minimum at \( x = 6 \) kg and \( y = 0 \) kg, and the minimum cost is \[ Z = 18(6) + 24(0) = \text{₹}108 \]

Everything you get with Solver7

More questions in Linear Programming