Detailed Explanation
In a Linear Programming Problem, the feasible region is the set of all points \((x, y)\) that satisfy every constraint at the same time. Each straight line drawn on the graph corresponds to one linear constraint written as an equation. To convert a boundary line into an inequality, we check whether the feasible (shaded) region lies on the side that includes the origin or the side that excludes it. If the feasible region lies away from the origin (origin does NOT satisfy the inequality), the constraint is of the type \(\ge\); if the feasible region lies towards the origin, it is of the type \(\le\). Since \(x\) and \(y\) represent quantities of food (in kg), they cannot be negative, giving the non-negativity constraints. From Figure-2 the boundary lines shown are \(3x + y = 8\), \(x + 2y = 10\) and \(4x + 5y = 28\), and the feasible region lies on the far side (away from the origin), so all these give \(\ge\) type inequalities.
Formula Used
A line \(ax + by = c\) gives \(ax + by \ge c\) when the feasible region is on the side NOT containing the origin, and \(ax + by \le c\) when it is on the side containing the origin. Non-negativity: \(x \ge 0,\ y \ge 0\).
Solution
- Step 1: List the boundary lines shown in Figure-2. The lines forming the boundary of the feasible region are: \[3x + y = 8\] \[x + 2y = 10\] \[4x + 5y = 28\] Each of these lines will become one constraint (inequality).
- Step 2: Fix the non-negativity constraints. Since \(x\) is the number of kg of food \(X\) and \(y\) is the number of kg of food \(Y\), quantities cannot be negative. Hence \[x \ge 0, \quad y \ge 0.\] The feasible region indeed lies in the first quadrant, which confirms this.
- Step 3: Decide the inequality sign for \(3x + y = 8\) by testing the origin \((0,0)\). Substituting gives \(3(0) + 0 = 0\), which is less than \(8\). The origin lies BELOW this line, but the feasible region lies on the upper side (away from the origin). So the origin must NOT satisfy the constraint, giving \[3x + y \ge 8.\]
- Step 4: Test the origin for \(x + 2y = 10\). Substituting gives \(0 + 0 = 0 < 10\). Again the feasible region lies away from the origin, so the origin should not satisfy the inequality. Therefore \[x + 2y \ge 10.\]
- Step 5: Test the origin for \(4x + 5y = 28\). Substituting gives \(0 + 0 = 0 < 28\). The feasible region again lies on the side away from the origin, so \[4x + 5y \ge 28.\]
- Step 6: Verify using a corner point of the feasible region, for example \(C(1, 5)\). Check: \(3(1) + 5 = 8 \ge 8\) (true), \(1 + 2(5) = 11 \ge 10\) (true), \(4(1) + 5(5) = 29 \ge 28\) (true), and \(x = 1 \ge 0,\ y = 5 \ge 0\) (true). All constraints hold, confirming the signs are correct.
Final Answer
The constraints determining the feasible region are: \[3x + y \ge 8\] \[x + 2y \ge 10\] \[4x + 5y \ge 28\] \[x \ge 0, \quad y \ge 0.\]
Common Mistake
A common mistake is writing all constraints as \(\le\) out of habit (as in maximisation problems) without testing the origin. Here the feasible region lies away from the origin, so the correct sign is \(\ge\). Students also often forget to include the non-negativity constraints \(x \ge 0\) and \(y \ge 0\).