SOLVER7 Study. Nothing Else.
2026 Board Paper Q29

Solve the following Linear Programming Problem graphically :
\(\begin{align}\text{Maximize Z = 200x + 120y}\\ \text{Subject to constraints }\\ x + y \le 300\\ 3x + y \le 600\\ x-y\ge-100\\ x,y\ge0\end{align}\)

CBSE Class 12 Maths · Linear Programming

Solution

👶 Simple Explanation

Simple Explanation

Imagine a shopkeeper who sells two items and wants to earn as much money as possible. There are limits on how many items can be made or stored. We draw those limits like fences on a graph. The best earning spot is always at a corner where fences meet. Here, the shopkeeper earns the most money, which is 48000, when 150 units of each item are made. Checking every corner point helps find that winning spot.

Answer: The maximum value is \( Z = 48000 \), attained at the point \( x = 150 \), \( y = 150 \), that is at the corner \( B(150, 150) \).

📖 Graphical Solution of an LPP: Maximizing Z = 200x + 120y

Detailed Explanation

In a Linear Programming Problem (LPP) we want to maximize or minimize 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. A key theorem states that if the maximum or minimum of the objective function exists, it always occurs at a corner point (vertex) of the feasible region. So the strategy is: draw each constraint line, shade the region satisfying all inequalities, identify the corner points, evaluate the objective function \( Z \) at each corner, and pick the largest (for maximization) value.

Formula Used

Objective function: \( Z = 200x + 120y \). Corner Point Method: evaluate \( Z \) at every vertex of the feasible region and choose the optimal value.

Solution

  1. Step 1: Write the constraints and convert each inequality into its boundary line. The constraints are \( x + y \le 300 \), \( 3x + y \le 600 \), \( x - y \ge -100 \) (equivalently \( y \le x + 100 \)), together with \( x \ge 0 \) and \( y \ge 0 \). The corresponding boundary lines are \( x + y = 300 \), \( 3x + y = 600 \), and \( x - y = -100 \).
  2. Step 2: Find intercepts to plot each line. For \( x + y = 300 \): points \( (300, 0) \) and \( (0, 300) \). For \( 3x + y = 600 \): points \( (200, 0) \) and \( (0, 600) \). For \( x - y = -100 \): points \( (0, 100) \) and \( (100, 200) \). Plot these lines on the coordinate plane.
  3. Step 3: Decide the correct side of each line by testing the origin \( (0,0) \). For \( x + y \le 300 \): \( 0 \le 300 \) is true, so keep the origin side. For \( 3x + y \le 600 \): \( 0 \le 600 \) is true, keep the origin side. For \( x - y \ge -100 \): \( 0 \ge -100 \) is true, keep the origin side. Together with \( x \ge 0 \) and \( y \ge 0 \), the feasible region is a bounded polygon in the first quadrant.
  4. Step 4: Find the corner points by solving the boundary lines that meet. Solving \( 3x + y = 600 \) with \( x + y = 300 \): subtracting gives \( 2x = 300 \), so \( x = 150 \) and \( y = 150 \), giving the point \( (150, 150) \). Solving \( x + y = 300 \) with \( x - y = -100 \): adding gives \( 2x = 200 \), so \( x = 100 \) and \( y = 200 \), giving the point \( (100, 200) \).
  5. Step 5: Collect all corner points of the feasible region. They are \( O(0, 0) \), \( A(200, 0) \), \( B(150, 150) \), \( C(100, 200) \), and \( D(0, 100) \). These are the vertices of the polygon bounded by the constraint lines and the axes.
  6. Step 6: Evaluate \( Z = 200x + 120y \) at each corner point. At \( O(0,0) \): \( Z = 0 \). At \( A(200, 0) \): \( Z = 200(200) + 120(0) = 40000 \). At \( B(150, 150) \): \( Z = 200(150) + 120(150) = 30000 + 18000 = 48000 \). At \( C(100, 200) \): \( Z = 200(100) + 120(200) = 20000 + 24000 = 44000 \). At \( D(0, 100) \): \( Z = 200(0) + 120(100) = 12000 \).
  7. Step 7: Compare all values of \( Z \). The values are \( 0, 40000, 48000, 44000, 12000 \). The largest is \( 48000 \), which occurs at the corner point \( B(150, 150) \). Since the feasible region is bounded, this is the maximum value.

Final Answer

The maximum value is \( Z = 48000 \), attained at the point \( x = 150 \), \( y = 150 \), that is at the corner \( B(150, 150) \).

Common Mistake

A common mistake is to misinterpret the constraint \( x - y \ge -100 \). Students often flip the inequality wrongly when rearranging it to \( y \le x + 100 \), or shade the wrong side of the line. Always rearrange carefully and test the origin \( (0,0) \) to confirm which side satisfies the inequality.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: List all constraints and identify their boundary lines. The constraints are \( x + y \le 300 \), \( 3x + y \le 600 \), \( y \le x + 100 \), \( x \ge 0 \), and \( y \ge 0 \). The boundary lines are \( x + y = 300 \), \( 3x + y = 600 \), and \( y = x + 100 \). — Reason: Converting inequalities to equations lets us draw the boundary of each half-plane on the coordinate axes.
  2. Step 2: Find axis intercepts of each boundary line to assist plotting. For \( x + y = 300 \): intercepts are \( (300, 0) \) and \( (0, 300) \). For \( 3x + y = 600 \): intercepts are \( (200, 0) \) and \( (0, 600) \). For \( y = x + 100 \): intercepts are \( (0, 100) \) and \( (-100, 0) \), with a convenient point at \( (100, 200) \). — Reason: Two points are sufficient to draw a straight line; intercepts are the easiest pair to compute.
  3. Step 3: Determine which side of each boundary satisfies the inequality by testing the origin \( (0, 0) \). For \( x + y \le 300 \): \( 0 + 0 = 0 \le 300 \) is true, so shade the side containing the origin. For \( 3x + y \le 600 \): \( 0 \le 600 \) is true, so again shade the origin side. For \( y \le x + 100 \): \( 0 \le 0 + 100 \) is true, so shade the origin side. Combined with \( x \ge 0 \) and \( y \ge 0 \), the feasible region lies in the first quadrant. — Reason: The feasible region is the intersection of all the half-planes; a test point quickly identifies the correct side.
  4. Step 4: Find the corner points of the feasible region by solving pairs of boundary lines simultaneously. Corner \( A \): intersection of \( y = x + 100 \) and \( x = 0 \) gives \( (0, 100) \). Corner \( B \): intersection of \( x + y = 300 \) and \( y = x + 100 \). Substituting \( y = x + 100 \) into \( x + y = 300 \) gives \( 2x + 100 = 300 \), so \( x = 100 \)… wait, let us redo carefully. \( x + (x + 100) = 300 \Rightarrow 2x = 200 \Rightarrow x = 100 \). Then \( y = 200 \). Hmm, checking against \( 3x + y \le 600 \): \( 300 + 200 = 500 \le 600 \) — valid. Corner \( C \): intersection of \( x + y = 300 \) and \( 3x + y = 600 \). Subtracting: \( 2x = 300 \Rightarrow x = 150 \), \( y = 150 \). Corner \( D \): intersection of \( 3x + y = 600 \) and \( y = 0 \) gives \( (200, 0) \). Corner \( O \): the origin \( (0, 0) \). — Reason: Corner points are found by solving the boundary equations in pairs; these vertices are where the optimal value of \( Z \) must occur.
  5. Step 5: Evaluate the objective function \( Z = 200x + 120y \) at each corner point. At \( O(0, 0) \): \( Z = 0 \). At \( A(0, 100) \): \( Z = 200(0) + 120(100) = 12000 \). At \( B(150, 150) \): \( Z = 200(150) + 120(150) = 30000 + 18000 = 48000 \). At \( C(200, 0) \): \( Z = 200(200) + 120(0) = 40000 \). At the corner \( (100, 200) \): \( Z = 200(100) + 120(200) = 20000 + 24000 = 44000 \). — Reason: The Corner Point Theorem guarantees the optimal value occurs at one of these vertices, so we simply compare them all.
  6. Step 6: Compare all values of \( Z \) obtained: \( 0,\ 12000,\ 48000,\ 40000,\ 44000 \). The largest value is \( 48000 \), occurring at the corner \( B(150, 150) \). — Reason: The vertex giving the highest \( Z \) is the solution to the maximisation problem.

Final Answer

The maximum value is \( Z = 48000 \), attained at the point \( x = 150 \), \( y = 150 \), that is at the corner \( B(150, 150) \).

Common Mistake

One common mistake: students forget to check all corner points of the feasible region and may stop after finding a large value at the first vertex they test — always evaluate \( Z \) at every vertex before concluding which is the maximum.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Identify corner points of the feasible region: Boundary lines: \( x + y = 300 \), \( 3x + y = 600 \), \( x - y = -100 \), with \( x \ge 0 \), \( y \ge 0 \). Corner points found by solving pairs of boundary equations: \( O(0, 0) \), \( A(0, 100) \), \( B(150, 150) \), \( C(200, 0) \).
  2. Step 2: Evaluate \( Z \) at each corner: At \( O(0,0) \): \( Z = 0 \). At \( A(0,100) \): \( Z = 200(0) + 120(100) = 12000 \). At \( B(150,150) \): \( Z = 200(150) + 120(150) = 30000 + 18000 = 48000 \). At \( C(200,0) \): \( Z = 200(200) + 120(0) = 40000 \).
  3. Step 3: Select maximum: Maximum \( Z = 48000 \) at \( B(150, 150) \).

Answer: The maximum value is \( Z = 48000 \), attained at the point \( x = 150 \), \( y = 150 \), that is at the corner \( B(150, 150) \).

➕ More Examples

More Examples

Example 1

Question: Solve the following Linear Programming Problem graphically: Maximize \[Z = 150x + 250y\] Subject to constraints: \[2x + y \le 500\] \[x + 3y \le 600\] \[x - y \ge -50\] \[x, y \ge 0\]

Solution: We maximize \(Z = 150x + 250y\) subject to the given constraints. Step 1: Find the boundary lines and their intercepts. For \(2x + y = 500\): intercepts are \((250, 0)\) and \((0, 500)\). For \(x + 3y = 600\): intercepts are \((600, 0)\) and \((0, 200)\). For \(x - y = -50\), i.e., \(y = x + 50\): intercepts are \((0, 50)\) and \((-50, 0)\) — but since \(x \ge 0\), relevant point is \((0, 50)\). Step 2: Determine the feasible region by checking which side of each boundary satisfies the inequality. Step 3: Find corner points of the feasible region. Corner Point A — intersection of \(x = 0\) and \(x - y = -50\): Setting \(x = 0\): \(-y = -50\), so \(y = 50\). Point: \((0, 50)\). Corner Point B — intersection of \(x = 0\) and \(x + 3y = 600\): Setting \(x = 0\): \(3y = 600\), so \(y = 200\). Point: \((0, 200)\). Corner Point C — intersection of \(2x + y = 500\) and \(x + 3y = 600\): From first equation: \(y = 500 - 2x\). Substituting: \[x + 3(500 - 2x) = 600\] \[x + 1500 - 6x = 600\] \[-5x = -900\] \[x = 180, \quad y = 500 - 360 = 140\] Point: \((180, 140)\). Corner Point D — intersection of \(2x + y = 500\) and \(y = 0\): Setting \(y = 0\): \(2x = 500\), so \(x = 250\). Point: \((250, 0)\). Corner Point E — intersection of \(x - y = -50\) and \(y = 0\): gives \(x = -50\), not valid since \(x \ge 0\). So the feasible region does not include this. We also check \(x = 0, y = 0\): \(x - y = 0 \ge -50\) (satisfied), \(2(0)+0 = 0 \le 500\) (satisfied), \(0 + 0 = 0 \le 600\) (satisfied). So origin is feasible, but let us verify all listed corners are vertices. The corner points of the feasible region are: \(A(0, 50)\), \(B(0, 200)\), \(C(180, 140)\), \(D(250, 0)\), and we check if \((0,0)\) is a vertex — it is not, because the constraint \(x - y \ge -50\) at \((0,0)\) gives \(0 \ge -50\) (satisfied) but the region boundary \(x - y = -50\) cuts the \(y\)-axis at \((0,50)\), so the lower part of the \(y\)-axis from \(0\) to \(50\) lies below the line \(y = x+50\) in the sense that \(x - y = -50\) is the lower limit. Actually at \((0,0)\): \(0 - 0 = 0 \ge -50\) is satisfied. So \((0,0)\) is in the feasible region but is it a corner? The region is bounded by \(x=0\), \(y=0\), and \(x - y \ge -50\). At \((0,0)\), \(x-y=0\) which is strictly \(\ge -50\), so \((0,0)\) is interior to that constraint — it is a corner of the region formed by \(x=0\) and \(y=0\). Let us list all corners carefully: The feasible region is bounded by \(x \ge 0\), \(y \ge 0\), \(2x+y \le 500\), \(x+3y \le 600\), \(x - y \ge -50\). On the \(x\)-axis (\(y=0\)): \(x - 0 \ge -50\) always for \(x \ge 0\). So the segment from \((0,0)\) to \((250,0)\) is feasible. On the \(y\)-axis (\(x=0\)): \(-y \ge -50 \Rightarrow y \le 50\) is required for \(x-y \ge -50\). Also \(3y \le 600 \Rightarrow y \le 200\) and \(y \le 500\). So on \(y\)-axis the feasible part is \(0 \le y \le 50\), giving vertex \((0,50)\) where \(x-y=-50\) meets \(x=0\). So corners are: \(O(0,0)\), \(A(0,50)\), then along \(x-y=-50\) to intersection with \(x+3y=600\). Intersection of \(x - y = -50\) and \(x + 3y = 600\): From first: \(x = y - 50\). Substituting: \[(y-50) + 3y = 600\] \[4y = 650\] \[y = 162.5, \quad x = 112.5\] Point: \((112.5,\ 162.5)\). Check \(2x+y\): \(2(112.5)+162.5 = 225+162.5 = 387.5 \le 500\). Valid. Corner Point E: \((112.5,\ 162.5)\). Then from E along \(x+3y=600\) to intersection with \(2x+y=500\): already found as \(C(180,140)\). Check \(x-y\) at C: \(180-140=40 \ge -50\). Valid. Then from C along \(2x+y=500\) to \(D(250,0)\). Check \(x+3y\) at D: \(250 \le 600\). Valid. Check \(x-y\): \(250 \ge -50\). Valid. From D along \(y=0\) back to \(O(0,0)\). So the corner points are: \(O(0,0)\), \(A(0,50)\), \(E(112.5,\ 162.5)\), \(C(180,\ 140)\), \(D(250,\ 0)\). Step 4: Evaluate \(Z = 150x + 250y\) at each corner. At \(O(0,0)\): \(Z = 0\). At \(A(0,50)\): \(Z = 150(0) + 250(50) = 12500\). At \(E(112.5,\ 162.5)\): \(Z = 150(112.5) + 250(162.5) = 16875 + 40625 = 57500\). At \(C(180,\ 140)\): \(Z = 150(180) + 250(140) = 27000 + 35000 = 62000\). At \(D(250,\ 0)\): \(Z = 150(250) + 250(0) = 37500\). Step 5: The maximum value of Z is at corner C. Maximum \(Z = 62000\) at \(x = 180,\ y = 140\).

Answer: Maximum \(Z = 62000\) at \(x = 180,\ y = 140\).

Example 2

Question: Solve the following Linear Programming Problem graphically: Maximize \[Z = 300x + 180y\] Subject to constraints: \[x + y \le 400\] \[2x + y \le 600\] \[x - 2y \le 200\] \[x, y \ge 0\]

Solution: We maximize \(Z = 300x + 180y\) subject to the given constraints. Step 1: Find boundary intercepts. For \(x + y = 400\): intercepts \((400, 0)\) and \((0, 400)\). For \(2x + y = 600\): intercepts \((300, 0)\) and \((0, 600)\). For \(x - 2y = 200\): intercepts \((200, 0)\) and \((0, -100)\) — the \(y\)-intercept is negative, so relevant in first quadrant only near \(x\)-axis. Step 2: Identify the feasible region satisfying all constraints and \(x, y \ge 0\). Step 3: Find corner points. Corner A — origin \((0, 0)\): Check \(x - 2y = 0 \le 200\) ✓, \(x+y=0\le 400\) ✓, \(2x+y=0\le600\) ✓. Valid. Corner B — intersection of \(x - 2y = 200\) and \(y = 0\): Setting \(y=0\): \(x = 200\). Point: \((200, 0)\). Check: \(200+0=200\le400\) ✓, \(400+0=400\le600\) ✓. Corner C — intersection of \(2x + y = 600\) and \(y = 0\): Setting \(y=0\): \(x=300\). Point: \((300, 0)\). Check \(x+y\): \(300\le400\) ✓. Check \(x-2y\): \(300\le200\)? No, \(300 > 200\). Not feasible. So \((300,0)\) is NOT in the feasible region. Let us find the intersection of \(x-2y=200\) and \(2x+y=600\): From first: \(x = 200 + 2y\). Substituting: \[2(200+2y)+y = 600\] \[400+4y+y = 600\] \[5y = 200\] \[y = 40, \quad x = 200+80 = 280\] Point: \((280, 40)\). Check \(x+y\): \(320\le400\) ✓. Corner C: \((280, 40)\). Corner D — intersection of \(2x+y=600\) and \(x+y=400\): Subtracting second from first: \(x = 200\), \(y = 200\). Point: \((200,200)\). Check \(x-2y\): \(200-400=-200\le200\) ✓. Corner D: \((200, 200)\). Corner E — intersection of \(x+y=400\) and \(x=0\): Setting \(x=0\): \(y=400\). Point: \((0,400)\). Check \(2x+y\): \(400\le600\) ✓. Check \(x-2y\): \(-800\le200\) ✓. Corner E: \((0, 400)\). Corner F — \(y\)-axis and \(y=0\): \((0,0)\) already listed as A. Also check if there is a corner between B and C along \(x-2y=200\): we already found \(C(280,40)\) is the intersection with \(2x+y=600\). Between B\((200,0)\) and C\((280,40)\) the boundary is \(x-2y=200\). The corner points of the feasible region are: \(A(0,0)\), \(B(200,0)\), \(C(280,40)\), \(D(200,200)\), \(E(0,400)\). Step 4: Evaluate \(Z = 300x + 180y\) at each corner. At \(A(0,0)\): \(Z = 0\). At \(B(200,0)\): \(Z = 300(200)+180(0) = 60000\). At \(C(280,40)\): \(Z = 300(280)+180(40) = 84000+7200 = 91200\). At \(D(200,200)\): \(Z = 300(200)+180(200) = 60000+36000 = 96000\). At \(E(0,400)\): \(Z = 300(0)+180(400) = 72000\). Step 5: The maximum value of Z occurs at D. Maximum \(Z = 96000\) at \(x = 200,\ y = 200\).

Answer: Maximum \(Z = 96000\) at \(x = 200,\ y = 200\).

🎯 Try a Similar Question

Try a Similar Question

Question: Solve the following Linear Programming Problem graphically: Maximize \ \( Z = 300x + 150y \) subject to the constraints: \( 2x + y \le 400 \), \( x + y \le 300 \), \( x - y \ge -100 \), \( x \ge 0 \), \( y \ge 0 \).

Solution

  1. Step 1: Identify the constraints and convert to equations: The constraints are: (i) \( 2x + y = 400 \) (ii) \( x + y = 300 \) (iii) \( x - y = -100 \), i.e., \( y = x + 100 \) (iv) \( x \ge 0 \), \( y \ge 0 \)
  2. Step 2: Find intercepts of boundary lines for sketching: For line (i): \( 2x + y = 400 \) — passes through \( (200, 0) \) and \( (0, 400) \). For line (ii): \( x + y = 300 \) — passes through \( (300, 0) \) and \( (0, 300) \). For line (iii): \( x - y = -100 \) — passes through \( (0, 100) \) and \( (-100, 0) \), but since \( x \ge 0 \), the relevant intercept is \( (0, 100) \).
  3. Step 3: Determine the feasible region: Check the origin \( (0, 0) \) in each inequality: For (i): \( 2(0) + 0 = 0 \le 400 \) — satisfied. For (ii): \( 0 + 0 = 0 \le 300 \) — satisfied. For (iii): \( 0 - 0 = 0 \ge -100 \) — satisfied. So the feasible region is on the origin side of lines (i) and (ii), and above line (iii), within the first quadrant.
  4. Step 4: Find the corner points of the feasible region: Corner A: Intersection of \( x - y = -100 \) and \( x = 0 \). Setting \( x = 0 \): \( -y = -100 \), so \( y = 100 \). Thus \( A = (0, 100) \). Corner B: Intersection of \( x + y = 300 \) and \( x - y = -100 \). Adding both equations: \( 2x = 200 \), so \( x = 100 \). Then \( y = 300 - 100 = 200 \). Thus \( B = (100, 200) \). Corner C: Intersection of \( 2x + y = 400 \) and \( x + y = 300 \). Subtracting: \( x = 100 \), then \( y = 200 \). Wait — re-checking: \( 2x + y = 400 \) and \( x + y = 300 \). Subtracting second from first: \( x = 100 \), then \( y = 300 - 100 = 200 \). So \( B \) and \( C \) coincide here; let us check correctly. Actually, subtracting \( (x + y = 300) \) from \( (2x + y = 400) \): \( x = 100 \), \( y = 200 \). This means lines (i) and (ii) meet at \( (100, 200) \), the same as \( B \). So corner \( C \) is the intersection of \( 2x + y = 400 \) and \( y = 0 \): setting \( y = 0 \), \( x = 200 \). Thus \( C = (200, 0) \). Corner D: On \( x - y = -100 \) and \( y = 0 \): \( x = -100 \), which violates \( x \ge 0 \), so not valid. Corner at origin: Check \( x - y \ge -100 \): \( 0 \ge -100 \) — satisfied, so \( O = (0, 0) \) is a corner. Summary of corner points: \( O(0, 0) \), \( A(0, 100) \), \( B(100, 200) \), \( C(200, 0) \).
  5. Step 5: Evaluate the objective function at each corner: At \( O(0, 0) \): \( Z = 300(0) + 150(0) = 0 \). At \( A(0, 100) \): \( Z = 300(0) + 150(100) = 15000 \). At \( B(100, 200) \): \( Z = 300(100) + 150(200) = 30000 + 30000 = 60000 \). At \( C(200, 0) \): \( Z = 300(200) + 150(0) = 60000 \).
  6. Step 6: Identify the maximum value: The maximum value of \( Z \) is \( 60000 \), attained at both \( B(100, 200) \) and \( C(200, 0) \). Since \( B \) and \( C \) are adjacent corner points on the feasible region with equal objective values, \( Z = 60000 \) is achieved at every point on the line segment \( BC \). Hence, the maximum value of \( Z \) is \( 60000 \).

Answer: The maximum value of \( Z = 300x + 150y \) is \( 60000 \), attained at every point on the line segment joining \( B(100, 200) \) and \( C(200, 0) \) (including both endpoints). Hence the LPP has infinitely many optimal solutions along segment \( BC \).

Everything you get with Solver7

More questions in Linear Programming