SOLVER7 Study. Nothing Else.
Exercise 12.1 Q6

Solve the following Linear Programming Problems graphically: \(Minimise\ Z = x + 2y\)
subject to \(2x + y \ge 3, x + 2y \ge 6, x, y \ge 0. \)

CBSE Class 12 Maths · Linear Programming

Solution

👶 Simple Explanation

Simple Explanation

Imagine you are shopping and want to spend as little money as possible. You have two rules: buy enough of item one, and buy enough of item two. The objective function \( Z = x + 2y \) tells you the total cost. We look at the corner points of the allowed region, just like checking the corners of a room for the coldest spot. At both corners \( (0, 3) \) and \( (6, 0) \), the cost equals \( 6 \). Every point on the line between them also gives the same cost, so the minimum is \( 6 \).

Answer: The minimum value of \( Z = x + 2y \) is \( 6 \). It is attained at every point on the line segment joining \( (0, 3) \) and \( (6, 0) \), including both corner points \( (0, 3) \) and \( (6, 0) \).

📖 Minimise Z = x + 2y (Graphical LPP)

Detailed Explanation

In Linear Programming, we optimise (minimise or maximise) a linear objective function subject to linear constraints. Each inequality defines a half-plane, and the overlap of all these half-planes forms the feasible region. The optimal value of the objective function always occurs at a corner point (vertex) of the feasible region. When the feasible region is unbounded, we must check whether the minimum value is actually attained. For minimisation of \( Z \), we test whether the open half-plane \( Z < m \) (where \( m \) is the smallest value found at a corner) has any point in common with the feasible region. If it does not, then \( m \) is the true minimum.

Formula Used

Objective function: \( Z = x + 2y \). Corner Point Method: evaluate \( Z \) at each vertex of the feasible region; the smallest value is the minimum (subject to the unbounded-region check).

Solution

  1. Step 1: Write the constraints clearly. We must minimise \( Z = x + 2y \) subject to \[ 2x + y \ge 3, \] \[ x + 2y \ge 6, \] \[ x \ge 0, \quad y \ge 0. \] The conditions \( x \ge 0 \) and \( y \ge 0 \) restrict us to the first quadrant.
  2. Step 2: Convert each inequality into an equation to draw the boundary lines. For \( 2x + y = 3 \): when \( x = 0, y = 3 \); when \( y = 0, x = \tfrac{3}{2} \). For \( x + 2y = 6 \): when \( x = 0, y = 3 \); when \( y = 0, x = 6 \).
  3. Step 3: Decide which side of each line is required. Test the origin \( (0,0) \). For \( 2x + y \ge 3 \): \( 0 \ge 3 \) is false, so the region lies on the side away from the origin. For \( x + 2y \ge 6 \): \( 0 \ge 6 \) is false, so again the region is away from the origin. Together with \( x, y \ge 0 \), the feasible region is unbounded and lies above both lines in the first quadrant.
  4. Step 4: Find the corner points of the feasible region. One corner is where \( x + 2y = 6 \) meets the y-axis, giving \( (0, 3) \). Another corner is where \( 2x + y = 3 \) meets the x-axis, giving \( (6, 0) \)? Check carefully: \( 2x + y = 3 \) gives x-intercept \( (\tfrac{3}{2}, 0) \), but this must also satisfy \( x + 2y \ge 6 \): \( \tfrac{3}{2} \ge 6 \) is false, so it is not feasible. The feasible boundary corner on the x-axis comes from \( x + 2y = 6 \), giving \( (6, 0) \).
  5. Step 5: Find the intersection of the two lines to locate the third corner. Solve \[ 2x + y = 3, \] \[ x + 2y = 6. \] From the first, \( y = 3 - 2x \). Substitute into the second: \[ x + 2(3 - 2x) = 6. \] This gives \[ x + 6 - 4x = 6 \Rightarrow -3x = 0 \Rightarrow x = 0, \; y = 3. \] So the two lines meet at \( (0, 3) \), which is already a corner. Hence the feasible corner points are \( (0, 3) \) and \( (6, 0) \).
  6. Step 6: Evaluate \( Z = x + 2y \) at each corner point. At \( (0, 3) \): \[ Z = 0 + 2(3) = 6. \] At \( (6, 0) \): \[ Z = 6 + 2(0) = 6. \] Both corner points give \( Z = 6 \).
  7. Step 7: Since the feasible region is unbounded, check whether \( 6 \) is really the minimum. Draw the line \( x + 2y = 6 \), i.e. \( Z = 6 \). Consider the open half-plane \( x + 2y < 6 \). This region has no point in common with the feasible region (because the feasible region requires \( x + 2y \ge 6 \)). Therefore \( Z \) cannot be made smaller than \( 6 \), and the minimum value is confirmed.

Final Answer

The minimum value of \( Z = x + 2y \) is \( 6 \). It is attained at every point on the line segment joining \( (0, 3) \) and \( (6, 0) \), including both corner points \( (0, 3) \) and \( (6, 0) \).

Common Mistake

A common mistake is to stop after finding \( Z = 6 \) at the corners without checking the unbounded region. For an unbounded feasible region you MUST verify that the half-plane \( Z < 6 \) (here \( x + 2y < 6 \)) does not overlap the feasible region; only then is \( 6 \) a genuine minimum.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: State the Problem Clearly: We want to minimise \( Z = x + 2y \) subject to the constraints \[ 2x + y \ge 3, \] \[ x + 2y \ge 6, \] \[ x \ge 0, \quad y \ge 0. \] — Reason: Writing every constraint explicitly ensures we do not miss any boundary of the feasible region before we begin graphing.
  2. Step 2: Find Intercepts of Each Boundary Line: For the line \( 2x + y = 3 \): set \( x = 0 \) to get \( y = 3 \), giving point \( (0, 3) \); set \( y = 0 \) to get \( x = \frac{3}{2} \), giving point \( \left(\frac{3}{2}, 0\right) \). For the line \( x + 2y = 6 \): set \( x = 0 \) to get \( y = 3 \), giving point \( (0, 3) \); set \( y = 0 \) to get \( x = 6 \), giving point \( (6, 0) \). — Reason: Two points fully determine a straight line, so intercepts are the quickest way to draw each boundary accurately.
  3. Step 3: Determine the Feasible Side of Each Line: Test the origin \( (0, 0) \) in each inequality. For \( 2x + y \ge 3 \): substituting gives \( 0 \ge 3 \), which is false, so the feasible region lies on the side away from the origin. For \( x + 2y \ge 6 \): substituting gives \( 0 \ge 6 \), which is false, so again the feasible region is on the side away from the origin. Combined with \( x \ge 0 \) and \( y \ge 0 \), the feasible region is the unbounded area in the first quadrant that lies above and to the right of both lines. — Reason: Testing a simple point like the origin quickly tells us which half-plane satisfies each constraint.
  4. Step 4: Identify the Corner Points of the Feasible Region: The boundary lines intersect the axes at \( (0, 3) \) (on both lines simultaneously, since both pass through this point) and at \( (6, 0) \) (from \( x + 2y = 6 \)). To check whether \( 2x + y = 3 \) and \( x + 2y = 6 \) share another intersection, solve simultaneously. Subtracting the first from twice the second gives \[ 2(x + 2y) - (2x + y) = 12 - 3, \] which simplifies to \( 3y = 9 \), so \( y = 3 \) and \( x = 0 \). Thus the two boundary lines meet only at \( (0, 3) \). The corner points of the feasible region are therefore \( (0, 3) \) and \( (6, 0) \). — Reason: Corner points are where boundaries intersect each other or the axes; the objective function is evaluated only at these vertices.
  5. Step 5: Evaluate Z at Each Corner Point: At \( (0, 3) \): \( Z = 0 + 2(3) = 6 \). At \( (6, 0) \): \( Z = 6 + 2(0) = 6 \). Both vertices give the same value \( Z = 6 \). — Reason: The Corner Point Method guarantees the optimum lies at a vertex, so computing \( Z \) at every vertex locates the minimum candidate.
  6. Step 6: Check the Unbounded Region (Half-Plane Test): Because the feasible region is unbounded, we must confirm that \( Z = 6 \) is a true minimum and not just an apparent one. Form the open half-plane \( x + 2y < 6 \). Check whether any point satisfying all original constraints also satisfies \( x + 2y < 6 \). The constraint \( x + 2y \ge 6 \) already forces every feasible point to have \( x + 2y \ge 6 \), so no feasible point can lie in \( x + 2y < 6 \). The two regions share no common point. — Reason: For an unbounded feasible region, a minimum candidate \( m \) is the true minimum only when the open half-plane \( Z < m \) has no overlap with the feasible region.
  7. Step 7: Conclude — Infinitely Many Optimal Points: Since both corner points \( (0, 3) \) and \( (6, 0) \) give \( Z = 6 \), and the objective function \( Z = x + 2y \) is linear, every point on the line segment joining these two corners also yields \( Z = 6 \). The half-plane test confirms no smaller value is achievable. — Reason: When two adjacent corner points share the same optimal value, the entire edge between them is also optimal; this is a standard result in linear programming.

Final Answer

The minimum value of \( Z = x + 2y \) is \( 6 \). It is attained at every point on the line segment joining \( (0, 3) \) and \( (6, 0) \), including both corner points \( (0, 3) \) and \( (6, 0) \).

Common Mistake

One common mistake: students stop after finding that both corner points give \( Z = 6 \) and declare the answer without performing the open half-plane test. For an unbounded feasible region this test is compulsory — without it you cannot be sure a smaller value does not exist somewhere in the unbounded part of the region.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Find boundary intersections: Line \( 2x + y = 3 \): intercepts \( (0, 3) \) and \( \left(\tfrac{3}{2}, 0\right) \). Line \( x + 2y = 6 \): intercepts \( (0, 3) \) and \( (6, 0) \). The two lines meet at \( (0, 3) \) (by inspection).
  2. Step 2: Identify corner points and evaluate Z: Corner points of the feasible region: \( (0, 3) \) and \( (6, 0) \). \[ Z(0,3) = 0 + 2(3) = 6 \] \[ Z(6,0) = 6 + 2(0) = 6 \]
  3. Step 3: Unbounded-region check: Check whether \( x + 2y < 6 \) has a common point with the feasible region. The open half-plane \( x + 2y < 6 \) does not intersect the feasible region, so \( Z_{\min} = 6 \) is confirmed.

Answer: The minimum value of \( Z = x + 2y \) is \( 6 \). It is attained at every point on the line segment joining \( (0, 3) \) and \( (6, 0) \), including both corner points \( (0, 3) \) and \( (6, 0) \).

➕ More Examples

More Examples

Example 1

Question: Solve the following Linear Programming Problem graphically: Minimise \( Z = 3x + y \) subject to the constraints \( x + y \ge 4 \), \( 3x + 2y \ge 9 \), \( x \ge 0 \), \( y \ge 0 \).

Solution: Step 1: Identify the constraints and objective function. Objective function: Minimise \( Z = 3x + y \) Constraints: \( x + y \ge 4 \), \( 3x + 2y \ge 9 \), \( x \ge 0 \), \( y \ge 0 \). Step 2: Find boundary lines and key intercepts. For \( x + y = 4 \): intercepts are \( (4, 0) \) and \( (0, 4) \). For \( 3x + 2y = 9 \): intercepts are \( (3, 0) \) and \( (0, 4.5) \). Step 3: Find the intersection of the two boundary lines. From \( x + y = 4 \) we get \( y = 4 - x \). Substituting into \( 3x + 2y = 9 \): \[ 3x + 2(4 - x) = 9 \] \[ 3x + 8 - 2x = 9 \] \[ x = 1, \quad y = 3 \] So the lines meet at \( (1, 3) \). Step 4: Identify the corner points of the feasible region. Since both constraints are of the \( \ge \) type and \( x, y \ge 0 \), the feasible region is unbounded (above and to the right of both lines). The relevant vertices are: From \( 3x + 2y \ge 9 \) along the x-axis: \( (3, 0) \). Check \( x + y \ge 4 \): \( 3 + 0 = 3 < 4 \). Not feasible. From \( x + y \ge 4 \) along the x-axis: \( (4, 0) \). Check \( 3x + 2y \ge 9 \): \( 12 \ge 9 \). Feasible. From \( 3x + 2y \ge 9 \) along the y-axis: \( (0, 4.5) \). Check \( x + y \ge 4 \): \( 4.5 \ge 4 \). Feasible. Intersection point: \( (1, 3) \). Check both constraints: \( 1 + 3 = 4 \ge 4 \) and \( 3(1) + 2(3) = 9 \ge 9 \). Feasible. Corner points of the feasible region: \( (4, 0) \), \( (1, 3) \), and \( (0, 4.5) \). Step 5: Evaluate \( Z = 3x + y \) at each corner point. At \( (4, 0) \): \( Z = 3(4) + 0 = 12 \) At \( (1, 3) \): \( Z = 3(1) + 3 = 6 \) At \( (0, 4.5) \): \( Z = 3(0) + 4.5 = 4.5 \) Step 6: Check for unbounded minimum. Draw the half-plane \( 3x + y < 4.5 \) and check if it intersects the feasible region. The line \( 3x + y = 4.5 \) passes below \( (0, 4.5) \) and does not share any common point with the feasible region (the feasible region lies entirely on or above both constraint lines). Therefore the minimum is indeed attained. The minimum value of \( Z \) is \( 4.5 \) at \( (0, 4.5) \).

Answer: Minimum \( Z = 4.5 \) at \( (0, 4.5) \).

Example 2

Question: Solve the following Linear Programming Problem graphically: Minimise \( Z = 2x + 5y \) subject to the constraints \( x + 2y \ge 4 \), \( 3x + y \ge 6 \), \( x \ge 0 \), \( y \ge 0 \).

Solution: Step 1: Identify the constraints and objective function. Objective function: Minimise \( Z = 2x + 5y \) Constraints: \( x + 2y \ge 4 \), \( 3x + y \ge 6 \), \( x \ge 0 \), \( y \ge 0 \). Step 2: Find boundary lines and key intercepts. For \( x + 2y = 4 \): intercepts are \( (4, 0) \) and \( (0, 2) \). For \( 3x + y = 6 \): intercepts are \( (2, 0) \) and \( (0, 6) \). Step 3: Find the intersection of the two boundary lines. From \( 3x + y = 6 \) we get \( y = 6 - 3x \). Substituting into \( x + 2y = 4 \): \[ x + 2(6 - 3x) = 4 \] \[ x + 12 - 6x = 4 \] \[ -5x = -8 \] \[ x = \frac{8}{5}, \quad y = 6 - 3 \cdot \frac{8}{5} = 6 - \frac{24}{5} = \frac{6}{5} \] The lines meet at \( \left(\dfrac{8}{5},\, \dfrac{6}{5}\right) \). Step 4: Identify the corner points of the feasible region. Check \( (4, 0) \): \( 3(4) + 0 = 12 \ge 6 \). Feasible. Check \( (0, 6) \): \( 0 + 2(6) = 12 \ge 4 \). Feasible. Check \( (2, 0) \): \( 2 + 0 = 2 < 4 \). Not feasible. Check \( (0, 2) \): \( 3(0) + 2 = 2 < 6 \). Not feasible. Corner points of the feasible region: \( (4, 0) \), \( \left(\dfrac{8}{5}, \dfrac{6}{5}\right) \), and \( (0, 6) \). Step 5: Evaluate \( Z = 2x + 5y \) at each corner point. At \( (4, 0) \): \( Z = 2(4) + 5(0) = 8 \) At \( \left(\dfrac{8}{5}, \dfrac{6}{5}\right) \): \( Z = 2 \cdot \dfrac{8}{5} + 5 \cdot \dfrac{6}{5} = \dfrac{16}{5} + \dfrac{30}{5} = \dfrac{46}{5} = 9.2 \) At \( (0, 6) \): \( Z = 2(0) + 5(6) = 30 \) Step 6: Check for unbounded minimum. The open half-plane \( 2x + 5y < 8 \) does not intersect the feasible region (every point in the feasible region satisfies \( Z \ge 8 \)), so the minimum is attained. The minimum value of \( Z \) is \( 8 \) at \( (4, 0) \).

Answer: Minimum \( Z = 8 \) at \( (4, 0) \).

🎯 Try a Similar Question

Try a Similar Question

Question: Solve the following Linear Programming Problem graphically: Minimise \( Z = 3x + y \) subject to the constraints \( x + y \ge 4 \), \( 2x + y \ge 6 \), \( x \ge 0 \), \( y \ge 0 \).

Solution

  1. Step 1: Identify the Constraints and Objective Function: Objective function: Minimise \( Z = 3x + y \). Constraints: \( x + y \ge 4 \) ... (i) \( 2x + y \ge 6 \) ... (ii) \( x \ge 0,\ y \ge 0 \) (non-negativity conditions)
  2. Step 2: Convert Inequalities to Equations and Find Intercepts: For line (i): \( x + y = 4 \) When \( x = 0 \), \( y = 4 \) giving point \( (0, 4) \). When \( y = 0 \), \( x = 4 \) giving point \( (4, 0) \). For line (ii): \( 2x + y = 6 \) When \( x = 0 \), \( y = 6 \) giving point \( (0, 6) \). When \( y = 0 \), \( x = 3 \) giving point \( (3, 0) \).
  3. Step 3: Find the Intersection Point of the Two Lines: Solve \( x + y = 4 \) and \( 2x + y = 6 \) simultaneously. Subtracting (i) from (ii): \[ (2x + y) - (x + y) = 6 - 4 \] \[ x = 2 \] Substituting \( x = 2 \) into \( x + y = 4 \): \[ 2 + y = 4 \implies y = 2 \] So the two lines intersect at \( (2, 2) \).
  4. Step 4: Identify the Feasible Region and Its Corner Points: Since both constraints are of the \( \ge \) type and \( x, y \ge 0 \), the feasible region lies above both lines in the first quadrant. It is an unbounded region. The corner points of the feasible region are: A = \( (0, 6) \) (from constraint (ii) on the y-axis), B = \( (2, 2) \) (intersection of the two lines), C = \( (4, 0) \) (from constraint (i) on the x-axis). Note: The point \( (3, 0) \) lies on line (ii) but does NOT satisfy constraint (i) since \( 3 + 0 = 3 < 4 \). Similarly, \( (0, 4) \) lies on line (i) but does NOT satisfy constraint (ii) since \( 0 + 4 = 4 < 6 \). So these are not corner points of the feasible region.
  5. Step 5: Evaluate the Objective Function at Each Corner Point: At A = \( (0, 6) \): \[ Z = 3(0) + 6 = 6 \] At B = \( (2, 2) \): \[ Z = 3(2) + 2 = 6 + 2 = 8 \] At C = \( (4, 0) \): \[ Z = 3(4) + 0 = 12 \]
  6. Step 6: Check for Unbounded Feasibility: Since the feasible region is unbounded, we must verify that \( Z = 6 \) is indeed the minimum and not just a local value. We check whether there exist points in the feasible region where \( Z < 6 \), i.e., \( 3x + y < 6 \). The open half-plane \( 3x + y < 6 \) and the feasible region have NO common point (since in the feasible region both \( x + y \ge 4 \) and \( 2x + y \ge 6 \) hold, any point there satisfies \( 3x + y \ge 3x + (6 - 2x) = x + 6 \ge 6 \) when \( x \ge 0 \), showing \( Z \ge 6 \) throughout). Hence the minimum value is confirmed to be \( 6 \).
  7. Step 7: State the Conclusion: The minimum value of \( Z = 3x + y \) is \( 6 \), attained at corner point A = \( (0, 6) \) only.

Answer: The minimum value of \( Z = 3x + y \) is \( 6 \), attained at the unique point \( (0, 6) \).

Everything you get with Solver7

More questions in Linear Programming