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

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 : Identify and write all the constraints which determine the given feasible region in Figure-2.

CBSE Class 12 Maths · Linear Programming

Solution

👶 Simple Explanation

Simple Explanation

Imagine you are packing a lunchbox and must meet certain nutrition rules. Each rule says you need at least a certain amount of something. On a graph, each rule looks like a straight line. The allowed zone — where all rules are satisfied — sits away from the zero corner. Because we need at least enough, every rule becomes a greater-than-or-equal type boundary. Also, food amounts can never be negative, so both quantities must be zero or more.

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.\]

📖 Identifying Constraints of a Feasible Region (LPP)

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

  1. 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).
  2. 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.
  3. 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.\]
  4. 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.\]
  5. 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.\]
  6. 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\).

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Read off the three boundary lines from Figure-2. The lines forming the edges of the feasible region are: \[ 3x + y = 8 \] \[ x + 2y = 10 \] \[ 4x + 5y = 28 \] — Reason: Every constraint in a Linear Programming Problem corresponds to a straight-line boundary on the graph, so identifying the lines is the first task before deciding the inequality direction.
  2. Step 2: Check the position of the origin \( (0, 0) \) with respect to each boundary line to determine the inequality direction. Substitute \( x = 0, y = 0 \) into \( 3x + y \): we get \( 3(0) + 0 = 0 \), which is less than \( 8 \). The origin gives \( 0 < 8 \), meaning the origin is NOT in the feasible region for this line. — Reason: If the feasible (shaded) region is on the opposite side from the origin, the inequality must be of the \( \ge \) type.
  3. Step 3: Apply the same origin-test to the second boundary. Substitute \( x = 0, y = 0 \) into \( x + 2y \): we get \( 0 + 2(0) = 0 \), which is less than \( 10 \). So the origin satisfies \( 0 < 10 \), confirming it lies outside the feasible region for this constraint as well. — Reason: Consistency of the origin test across all lines ensures the feasible region is uniformly on the far side, so this constraint is also \( \ge \) type.
  4. Step 4: Apply the origin-test to the third boundary. Substitute \( x = 0, y = 0 \) into \( 4x + 5y \): we get \( 4(0) + 5(0) = 0 \), which is less than \( 28 \). The origin gives \( 0 < 28 \), so it lies on the side NOT included in the feasible region. — Reason: Once again the origin is excluded, so this boundary also yields a \( \ge \) inequality, matching the direction of the shaded region in the figure.
  5. Step 5: Write the non-negativity constraints. Since \( x \) represents kilograms of Food X and \( y \) represents kilograms of Food Y, neither can be negative, giving \( x \ge 0 \) and \( y \ge 0 \). — Reason: In any real-world LP problem involving physical quantities such as weight, time, or money, variables must be non-negative; these constraints restrict the feasible region to the first quadrant of the coordinate plane.
  6. Step 6: Combine all findings to state the complete system of constraints: \[ 3x + y \ge 8 \] \[ x + 2y \ge 10 \] \[ 4x + 5y \ge 28 \] \[ x \ge 0, \quad y \ge 0 \] — Reason: The feasible region is exactly the set of all points \( (x, y) \) satisfying ALL these inequalities simultaneously, which matches the shaded region shown in Figure-2.

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

One common mistake: students sometimes flip the inequality direction — writing \( \le \) instead of \( \ge \) — because they forget to check which side of the boundary line the shaded feasible region actually lies on. Always substitute the origin \( (0, 0) \) into the boundary equation and compare the result with the constant on the right; if the origin does NOT satisfy the inequality, the correct sign is \( \ge \).

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Boundary lines from Figure-2: \[ 3x + y = 8, \quad x + 2y = 10, \quad 4x + 5y = 28 \]
  2. Step 2: Feasible region lies away from the origin, so each line gives a \( \ge \) inequality.
  3. Step 3: Non-negativity constraints (quantities cannot be negative): \( x \ge 0, \quad y \ge 0 \).

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.\]

➕ More Examples

More Examples

Example 1

Question: A school canteen wishes to minimise the cost of preparing a protein-rich meal using two food items, Food A (\( x \) kg) and Food B (\( y \) kg), costing ₹ 10/kg and ₹ 15/kg respectively. Each kg of Food A provides 3 units of protein and 2 units of carbohydrates. Each kg of Food B provides 2 units of protein and 4 units of carbohydrates. The daily meal must provide at least 12 units of protein and at least 16 units of carbohydrates. Also, the canteen cannot use more than 8 kg of food in total per day, and the quantities cannot be negative. Identify and write all the constraints which determine the feasible region for this problem.

Solution: We define the decision variables: let \( x \) = kg of Food A used, and \( y \) = kg of Food B used. Constraint 1 (Protein requirement): Each kg of Food A gives 3 units and each kg of Food B gives 2 units of protein. The meal needs at least 12 units. \[ 3x + 2y \ge 12 \] Constraint 2 (Carbohydrate requirement): Each kg of Food A gives 2 units and each kg of Food B gives 4 units of carbohydrates. The meal needs at least 16 units. \[ 2x + 4y \ge 16 \] Dividing through by 2: \[ x + 2y \ge 8 \] Constraint 3 (Total quantity limit): The total food used cannot exceed 8 kg per day. \[ x + y \le 8 \] Constraint 4 and 5 (Non-negativity): Quantities of food cannot be negative. \[ x \ge 0,\quad y \ge 0 \] So all the constraints are: \[ 3x + 2y \ge 12 \] \[ x + 2y \ge 8 \] \[ x + y \le 8 \] \[ x \ge 0,\quad y \ge 0 \]

Answer: The constraints are: \( 3x + 2y \ge 12 \), \( x + 2y \ge 8 \), \( x + y \le 8 \), \( x \ge 0 \), \( y \ge 0 \).

Example 2

Question: A health clinic recommends a special diet to patients using two types of supplements, Supplement P (\( x \) units) and Supplement Q (\( y \) units), costing ₹ 25 per unit and ₹ 30 per unit respectively. Each unit of Supplement P contains 4 mg of iron and 1 mg of vitamin C. Each unit of Supplement Q contains 2 mg of iron and 3 mg of vitamin C. A patient requires at least 20 mg of iron and at least 12 mg of vitamin C daily. Also, due to medical restrictions, the patient should not consume more than 7 units of Supplement P and not more than 6 units of Supplement Q per day, and the quantities must be non-negative. Identify and write all the constraints which determine the feasible region for this problem.

Solution: We define the decision variables: let \( x \) = units of Supplement P taken, and \( y \) = units of Supplement Q taken. Constraint 1 (Iron requirement): Each unit of Supplement P gives 4 mg and each unit of Supplement Q gives 2 mg of iron. The patient needs at least 20 mg. \[ 4x + 2y \ge 20 \] Dividing through by 2: \[ 2x + y \ge 10 \] Constraint 2 (Vitamin C requirement): Each unit of Supplement P gives 1 mg and each unit of Supplement Q gives 3 mg of vitamin C. The patient needs at least 12 mg. \[ x + 3y \ge 12 \] Constraint 3 (Upper limit on Supplement P): The patient must not consume more than 7 units of Supplement P. \[ x \le 7 \] Constraint 4 (Upper limit on Supplement Q): The patient must not consume more than 6 units of Supplement Q. \[ y \le 6 \] Constraint 5 and 6 (Non-negativity): Quantities cannot be negative. \[ x \ge 0,\quad y \ge 0 \] So all the constraints are: \[ 2x + y \ge 10 \] \[ x + 3y \ge 12 \] \[ x \le 7 \] \[ y \le 6 \] \[ x \ge 0,\quad y \ge 0 \]

Answer: The constraints are: \( 2x + y \ge 10 \), \( x + 3y \ge 12 \), \( x \le 7 \), \( y \le 6 \), \( x \ge 0 \), \( y \ge 0 \).

🎯 Try a Similar Question

Try a Similar Question

Question: As part of a fitness campaign, a nutritionist wants to minimise the cost of a daily diet plan involving two food supplements, Supplement A (\(x\) kg) and Supplement B (\(y\) kg), available at ₹ 12/kg and ₹ 18/kg respectively. The feasible region satisfying the diet requirements is bounded by the following boundary lines (read from the graph): - Line 1 passes through the points \((6, 0)\) and \((0, 3)\). - Line 2 passes through the points \((2, 0)\) and \((0, 6)\). - Line 3 passes through the points \((4, 0)\) and \((0, 8)\). - The feasible region lies above or on each of these lines, and in the first quadrant. Identify and write all the constraints which determine the given feasible region.

Solution

  1. Step 1: Find the equation of Line 1: Line 1 passes through \((6, 0)\) and \((0, 3)\). Using intercept form: \[\frac{x}{6} + \frac{y}{3} = 1\] Multiplying throughout by 6: \[x + 2y = 6\] Since the feasible region lies on or above this line, the constraint is: \[x + 2y \ge 6\]
  2. Step 2: Find the equation of Line 2: Line 2 passes through \((2, 0)\) and \((0, 6)\). Using intercept form: \[\frac{x}{2} + \frac{y}{6} = 1\] Multiplying throughout by 6: \[3x + y = 6\] Since the feasible region lies on or above this line, the constraint is: \[3x + y \ge 6\]
  3. Step 3: Find the equation of Line 3: Line 3 passes through \((4, 0)\) and \((0, 8)\). Using intercept form: \[\frac{x}{4} + \frac{y}{8} = 1\] Multiplying throughout by 8: \[2x + y = 8\] Since the feasible region lies on or above this line, the constraint is: \[2x + y \ge 8\]
  4. Step 4: Include non-negativity constraints: Since the quantities of food supplements cannot be negative, we must include: \[x \ge 0, \quad y \ge 0\]
  5. Step 5: Write all constraints together: Combining all the constraints, the complete set determining the feasible region is: \[x + 2y \ge 6\] \[3x + y \ge 6\] \[2x + y \ge 8\] \[x \ge 0, \quad y \ge 0\]

Answer: The constraints determining the feasible region are: \[x + 2y \ge 6\] \[3x + y \ge 6\] \[2x + y \ge 8\] \[x \ge 0, \quad y \ge 0\]

Everything you get with Solver7

More questions in Linear Programming