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.