SOLVER7 Study. Nothing Else.
2023 Board Paper Q29

Solve the following linear programming problem graphically :
\( \begin{aligned} \text{Maximize : } Z=x+2y\\ \text{subject to constraints : } x+2y \ge 100,\\ 2x-y \le 0,\\ 2x+y \le 200,\\ x \ge 0,\; y \ge 0. \end{aligned}\)

CBSE Class 12 Maths · Linear Programming

Solution

👶 Simple Explanation

Simple Explanation

Imagine you are packing two types of snacks into a bag, but the bag has size limits. You want to pack as much value as possible without breaking the rules. Each rule is like a boundary fence on a map. The best packing spot is always at a corner where two fences meet. We check every such corner, add up the value there, and pick the biggest total. Here, the biggest value turns out to be \( Z = 400 \), found at the corner point \( (0, 200) \).

Answer: The maximum value is \( Z = 400 \), achieved at the point \( (x, y) = (0, 200) \).

📖 Graphical Solution of an LPP: Maximize Z = x + 2y

Detailed Explanation

In Linear Programming, we want to optimise (maximise or minimise) a linear function called the objective function, subject to a set of linear inequalities called constraints. The set of all points satisfying every constraint is called the feasible region. By the Corner Point Theorem, if an optimal value of the objective function exists, it occurs at a vertex (corner point) of the feasible region. So our job is to draw all constraint lines, shade the feasible region, find its corner points, and evaluate \( Z \) at each corner point. The largest value gives the maximum.

Formula Used

Objective function: \( Z = x + 2y \). Corner Point Theorem: the optimum of \( Z \) occurs at a corner point of the feasible region.

Solution

  1. Step 1: List the constraints. We must satisfy \( x + 2y \ge 100 \), \( 2x - y \le 0 \), \( 2x + y \le 200 \), \( x \ge 0 \), and \( y \ge 0 \). We first convert each inequality into an equation to draw its boundary line.
  2. Step 2: Draw the boundary lines. For \( x + 2y = 100 \): when \( x = 0, y = 50 \); when \( y = 0, x = 100 \). For \( 2x - y = 0 \): this passes through the origin, e.g. points \( (0,0) \) and \( (50,100) \). For \( 2x + y = 200 \): when \( x = 0, y = 200 \); when \( y = 0, x = 100 \).
  3. Step 3: Decide the correct side of each line using a test point. For \( x + 2y \ge 100 \), the origin \( (0,0) \) gives \( 0 \ge 100 \), which is false, so we take the side away from the origin. For \( 2x - y \le 0 \), test \( (0,50) \): \( -50 \le 0 \) is true, so keep the side containing \( (0,50) \). For \( 2x + y \le 200 \), test \( (0,0) \): \( 0 \le 200 \) is true, so keep the origin side. Also \( x \ge 0 \) and \( y \ge 0 \) keep us in the first quadrant.
  4. Step 4: Find the corner points by solving the boundary lines in pairs. Intersection of \( x + 2y = 100 \) and \( 2x - y = 0 \): from the second, \( y = 2x \), so \( x + 4x = 100 \), giving \( x = 20, y = 40 \), point \( (20,40) \). Intersection of \( 2x - y = 0 \) and \( 2x + y = 200 \): adding, \( 4x = 200 \), so \( x = 50, y = 100 \), point \( (50,100) \). Intersection of \( x + 2y = 100 \) and \( 2x + y = 200 \): from the first \( x = 100 - 2y \), substitute to get \( 200 - 4y + y = 200 \), so \( y = 0, x = 100 \), point \( (100,0) \).
  5. Step 5: Identify all corner points of the feasible region. They are \( (0,50) \), \( (0,200) \), \( (20,40) \), \( (50,100) \). (The point \( (100,0) \) lies on \( 2x - y \le 0 \) boundary check: \( 200 - 0 = 200 > 0 \), so it violates \( 2x - y \le 0 \) and is not a vertex of this region.) The valid vertices are \( (0,50) \), \( (20,40) \), \( (50,100) \), and \( (0,200) \).
  6. Step 6: Evaluate \( Z = x + 2y \) at each corner point. At \( (0,50) \): \( Z = 0 + 100 = 100 \). At \( (20,40) \): \( Z = 20 + 80 = 100 \). At \( (50,100) \): \( Z = 50 + 200 = 250 \). At \( (0,200) \): \( Z = 0 + 400 = 400 \).
  7. Step 7: Compare the values. The largest value of \( Z \) is \( 400 \), which occurs at the corner point \( (0,200) \). Since the feasible region is bounded, this maximum is attained.

Final Answer

The maximum value is \( Z = 400 \), achieved at the point \( (x, y) = (0, 200) \).

Common Mistake

A common mistake is choosing the wrong side of the line \( x + 2y \ge 100 \) by shading toward the origin, or forgetting to test each corner point against all constraints, which can wrongly include the point \( (100,0) \) that actually violates \( 2x - y \le 0 \).

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Write down all five constraints: \( x + 2y \ge 100 \), \( 2x - y \le 0 \), \( 2x + y \le 200 \), \( x \ge 0 \), and \( y \ge 0 \). — Reason: Listing constraints clearly helps us identify every boundary line we need to draw and every condition the feasible region must satisfy.
  2. Step 2: Convert each inequality to an equation and find two points on each boundary line. For \( x + 2y = 100 \): at \( x = 0 \) we get \( y = 50 \), and at \( y = 0 \) we get \( x = 100 \), giving points \( (0, 50) \) and \( (100, 0) \). For \( 2x - y = 0 \): rewrite as \( y = 2x \); two convenient points are \( (0, 0) \) and \( (50, 100) \). For \( 2x + y = 200 \): at \( x = 0 \) we get \( y = 200 \), and at \( y = 0 \) we get \( x = 100 \), giving points \( (0, 200) \) and \( (100, 0) \). — Reason: Two points uniquely determine a straight line, so this lets us draw each boundary accurately on the graph.
  3. Step 3: Determine which side of each boundary belongs to the feasible region using a test point. For \( x + 2y \ge 100 \), test \( (0, 0) \): \( 0 + 0 = 0 \not\ge 100 \), so the feasible side is away from the origin. For \( 2x - y \le 0 \), test \( (0, 50) \): \( 0 - 50 = -50 \le 0 \), which is true, so the feasible side contains \( (0, 50) \). For \( 2x + y \le 200 \), test \( (0, 0) \): \( 0 + 0 = 0 \le 200 \), which is true, so the feasible side contains the origin. The conditions \( x \ge 0 \) and \( y \ge 0 \) restrict us to the first quadrant. — Reason: A test point quickly tells us which half-plane to shade, so we identify the correct feasible region without ambiguity.
  4. Step 4: Find the corner points of the feasible region by solving pairs of boundary equations simultaneously. Intersection of \( 2x - y = 0 \) and \( x + 2y = 100 \): substituting \( y = 2x \) gives \( x + 4x = 100 \), so \( x = 20 \) and \( y = 40 \), yielding the point \( (20, 40) \). Intersection of \( 2x - y = 0 \) and \( 2x + y = 200 \): adding the two equations gives \( 4x = 200 \), so \( x = 50 \) and \( y = 100 \), yielding the point \( (50, 100) \). The boundary \( x = 0 \) combined with \( 2x + y \le 200 \) gives the vertex \( (0, 200) \), and combined with \( x + 2y \ge 100 \) gives the vertex \( (0, 50) \). — Reason: Corner points are intersections of boundary lines, and by the Corner Point Theorem these are the only candidates for the optimal value of \( Z \).
  5. Step 5: Evaluate the objective function \( Z = x + 2y \) at each corner point. At \( (0, 50) \): \( Z = 0 + 2(50) = 100 \). At \( (20, 40) \): \( Z = 20 + 2(40) = 20 + 80 = 100 \). At \( (50, 100) \): \( Z = 50 + 2(100) = 50 + 200 = 250 \). At \( (0, 200) \): \( Z = 0 + 2(200) = 400 \). — Reason: Evaluating \( Z \) at every vertex lets us compare values and identify the maximum by inspection.
  6. Step 6: Compare the values: \( 100, 100, 250, 400 \). The largest value is \( 400 \), occurring at the corner \( (0, 200) \). — Reason: The highest value among all corner-point evaluations is the maximum of \( Z \) over the feasible region, guaranteed by the Corner Point Theorem.

Final Answer

The maximum value is \( Z = 400 \), achieved at the point \( (x, y) = (0, 200) \).

Common Mistake

One common mistake: students forget to check ALL corner points and stop as soon as they find a large value — always evaluate \( Z \) at every vertex before concluding which one gives the true maximum.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Find corner points of the feasible region: Intersection of \( 2x - y = 0 \) and \( x + 2y = 100 \): substituting \( y = 2x \) gives \( x + 4x = 100 \), so \( x = 20, y = 40 \). Intersection of \( 2x - y = 0 \) and \( 2x + y = 200 \): adding gives \( 4x = 200 \), so \( x = 50, y = 100 \). Boundary vertices: \( (0, 50) \), \( (20, 40) \), \( (50, 100) \), \( (0, 200) \).
  2. Step 2: Evaluate \( Z = x + 2y \) at each corner point: At \( (0, 50) \): \( Z = 0 + 100 = 100 \). At \( (20, 40) \): \( Z = 20 + 80 = 100 \). At \( (50, 100) \): \( Z = 50 + 200 = 250 \). At \( (0, 200) \): \( Z = 0 + 400 = 400 \).
  3. Step 3: Identify maximum: Maximum value is \( Z = 400 \) at \( (x, y) = (0, 200) \).

Answer: The maximum value is \( Z = 400 \), achieved at the point \( (x, y) = (0, 200) \).

➕ More Examples

More Examples

Example 1

Question: Solve the following linear programming problem graphically: Maximize: \[Z = 3x + 5y\] subject to the constraints: \[x + y \le 120,\quad 3x + y \ge 60,\quad x + 3y \ge 60,\quad x \ge 0,\; y \ge 0.\]

Solution: We first identify the boundary lines and feasible region. Boundary Lines: Line 1: \(x + y = 120\). Two points: \((0, 120)\) and \((120, 0)\). Line 2: \(3x + y = 60\). Two points: \((0, 60)\) and \((20, 0)\). Line 3: \(x + 3y = 60\). Two points: \((60, 0)\) and \((0, 20)\). Feasible Region: We need \(x + y \le 120\) (below or on Line 1), \(3x + y \ge 60\) (above or on Line 2), \(x + 3y \ge 60\) (above or on Line 3), and \(x \ge 0,\; y \ge 0\). Finding Corner Points: Corner A: Intersection of \(3x + y = 60\) and \(x = 0\): \[x = 0 \Rightarrow y = 60.\] So \(A = (0, 60)\). Corner B: Intersection of \(x + y = 120\) and \(x = 0\): \[x = 0 \Rightarrow y = 120.\] So \(B = (0, 120)\). Corner C: Intersection of \(x + y = 120\) and \(y = 0\): \[y = 0 \Rightarrow x = 120.\] So \(C = (120, 0)\). Corner D: Intersection of \(x + 3y = 60\) and \(y = 0\): \[y = 0 \Rightarrow x = 60.\] So \(D = (60, 0)\). Corner E: Intersection of \(3x + y = 60\) and \(x + 3y = 60\). Subtract: \(3x + y - (x + 3y) = 0\) gives \(2x - 2y = 0\), so \(x = y\). Substituting into \(3x + y = 60\): \(4x = 60\), so \(x = 15,\; y = 15\). So \(E = (15, 15)\). We check: \(15 + 15 = 30 \le 120\). Yes, E is feasible. Verify all corners are feasible: - \(A = (0, 60)\): \(0+60=60\le120\); \(0+60=60\ge60\); \(0+180=180\ge60\). Feasible. - \(B = (0, 120)\): \(120\le120\); \(0+120=120\ge60\); \(0+360=360\ge60\). Feasible. - \(C = (120, 0)\): \(120\le120\); \(360+0=360\ge60\); \(120+0=120\ge60\). Feasible. - \(D = (60, 0)\): \(60\le120\); \(180\ge60\); \(60\ge60\). Feasible. - \(E = (15, 15)\): \(30\le120\); \(60\ge60\); \(60\ge60\). Feasible. Evaluating \(Z = 3x + 5y\) at each corner: At \(A = (0, 60)\): \[Z = 3(0) + 5(60) = 300.\] At \(B = (0, 120)\): \[Z = 3(0) + 5(120) = 600.\] At \(C = (120, 0)\): \[Z = 3(120) + 5(0) = 360.\] At \(D = (60, 0)\): \[Z = 3(60) + 5(0) = 180.\] At \(E = (15, 15)\): \[Z = 3(15) + 5(15) = 45 + 75 = 120.\] The maximum value of \(Z\) is 600 at the corner point \(B = (0, 120)\).

Answer: Maximum value of \(Z = 3x + 5y\) is \(600\), attained at \((x, y) = (0, 120)\).

Example 2

Question: Solve the following linear programming problem graphically: Maximize: \[Z = 4x + 3y\] subject to the constraints: \[2x + y \le 180,\quad x + 2y \le 150,\quad x + y \ge 60,\quad x \ge 0,\; y \ge 0.\]

Solution: We identify the boundary lines and feasible region. Boundary Lines: Line 1: \(2x + y = 180\). Points: \((0, 180)\) and \((90, 0)\). Line 2: \(x + 2y = 150\). Points: \((0, 75)\) and \((150, 0)\). Line 3: \(x + y = 60\). Points: \((0, 60)\) and \((60, 0)\). Feasible Region: \(2x + y \le 180\), \(x + 2y \le 150\), \(x + y \ge 60\), \(x \ge 0\), \(y \ge 0\). Finding Corner Points: Corner A: Intersection of \(x + y = 60\) and \(x = 0\): \[x = 0 \Rightarrow y = 60.\] Check: \(2(0)+60=60\le180\); \(0+120=120\le150\). Feasible. So \(A = (0, 60)\). Corner B: Intersection of \(x + 2y = 150\) and \(x = 0\): \[x = 0 \Rightarrow 2y = 150 \Rightarrow y = 75.\] Check: \(0+75=75\le180\); \(0+75=75\ge60\). Feasible. So \(B = (0, 75)\). Corner C: Intersection of \(2x + y = 180\) and \(x + 2y = 150\). From Line 1: \(y = 180 - 2x\). Substitute into Line 2: \[x + 2(180 - 2x) = 150 \Rightarrow x + 360 - 4x = 150 \Rightarrow -3x = -210 \Rightarrow x = 70.\] Then \(y = 180 - 140 = 40\). Check: \(70+40=110\ge60\). Feasible. So \(C = (70, 40)\). Corner D: Intersection of \(2x + y = 180\) and \(y = 0\): \[2x = 180 \Rightarrow x = 90.\] Check: \(90+0=90\ge60\); \(90+0=90\le150\). Feasible. So \(D = (90, 0)\). Corner E: Intersection of \(x + y = 60\) and \(y = 0\): \[x = 60.\] Check: \(120+0=120\le180\); \(60+0=60\le150\). Feasible. So \(E = (60, 0)\). Evaluating \(Z = 4x + 3y\) at each corner: At \(A = (0, 60)\): \[Z = 4(0) + 3(60) = 180.\] At \(B = (0, 75)\): \[Z = 4(0) + 3(75) = 225.\] At \(C = (70, 40)\): \[Z = 4(70) + 3(40) = 280 + 120 = 400.\] At \(D = (90, 0)\): \[Z = 4(90) + 3(0) = 360.\] At \(E = (60, 0)\): \[Z = 4(60) + 3(0) = 240.\] The maximum value of \(Z\) is 400 at the corner point \(C = (70, 40)\).

Answer: Maximum value of \(Z = 4x + 3y\) is \(400\), attained at \((x, y) = (70, 40)\).

🎯 Try a Similar Question

Try a Similar Question

Question: Solve the following linear programming problem graphically: Maximize \( Z = 3x + 5y \) subject to the constraints: \( x + y \le 150 \), \( 3x + y \le 300 \), \( x + 3y \ge 60 \), \( x \ge 0 \), \( y \ge 0 \).

Solution

  1. Step 1: List the constraints and objective function: We want to maximize \( Z = 3x + 5y \) subject to: Constraint 1: \( x + y \le 150 \) Constraint 2: \( 3x + y \le 300 \) Constraint 3: \( x + 3y \ge 60 \) Constraint 4: \( x \ge 0,\; y \ge 0 \)
  2. Step 2: Find boundary lines and key intersection points: Convert each inequality to an equation to find boundary lines. Line 1: \( x + y = 150 \) passes through \( (0, 150) \) and \( (150, 0) \). Line 2: \( 3x + y = 300 \) passes through \( (0, 300) \) and \( (100, 0) \). Line 3: \( x + 3y = 60 \) passes through \( (0, 20) \) and \( (60, 0) \).
  3. Step 3: Find intersection of Line 1 and Line 2: Solve simultaneously \( x + y = 150 \) and \( 3x + y = 300 \). Subtracting the first from the second: \( 2x = 150 \), so \( x = 75 \). Substituting back: \( 75 + y = 150 \), so \( y = 75 \). Intersection point: \( (75, 75) \).
  4. Step 4: Find intersection of Line 1 with the y-axis: Setting \( x = 0 \) in \( x + y = 150 \) gives \( y = 150 \). So one corner is \( (0, 150) \). Check it satisfies all constraints: \( 0 + 150 \le 150 \) ✓, \( 0 + 150 \le 300 \) ✓, \( 0 + 450 \ge 60 \) ✓.
  5. Step 5: Find intersection of Line 2 with the x-axis: Setting \( y = 0 \) in \( 3x + y = 300 \) gives \( x = 100 \). So one corner candidate is \( (100, 0) \). Check constraint 3: \( 100 + 0 = 100 \ge 60 \) ✓. All constraints satisfied.
  6. Step 6: Identify all corner points of the feasible region: The feasible region is bounded. Its corner (vertex) points are: \( A = (0, 20) \) (intersection of \( x = 0 \) and Line 3: \( 0 + 3y = 60 \Rightarrow y = 20 \)) \( B = (0, 150) \) (intersection of \( x = 0 \) and Line 1) \( C = (75, 75) \) (intersection of Line 1 and Line 2) \( D = (100, 0) \) (intersection of Line 2 and \( y = 0 \)) \( E = (60, 0) \) (intersection of Line 3 and \( y = 0 \): \( x + 0 = 60 \))
  7. Step 7: Evaluate Z at each corner point: At \( A = (0, 20) \): \( Z = 3(0) + 5(20) = 100 \) At \( B = (0, 150) \): \( Z = 3(0) + 5(150) = 750 \) At \( C = (75, 75) \): \( Z = 3(75) + 5(75) = 225 + 375 = 600 \) At \( D = (100, 0) \): \( Z = 3(100) + 5(0) = 300 \) At \( E = (60, 0) \): \( Z = 3(60) + 5(0) = 180 \)
  8. Step 8: Determine the maximum value: Comparing all values: \( 100,\; 750,\; 600,\; 300,\; 180 \). The maximum value is \( Z = 750 \), attained at the corner point \( B = (0, 150) \).

Answer: The maximum value of \( Z = 3x + 5y \) is \( Z = 750 \), achieved at the point \( (x, y) = (0, 150) \).

Everything you get with Solver7

More questions in Linear Programming