SOLVER7 Study. Nothing Else.
2026 Board Paper Q33

Solve the following Linear Programming Problem graphically :
\(\begin{align}\text{Maximize Z = 600x + 400y}\\ \text{Subject to constraints }\\ x + 2y \le 12\\ 4x + 5y \ge 20\\ 2x+y\le12\\ x ,y\ge0\end{align}\)

CBSE Class 12 Maths · Linear Programming

Solution

👶 Simple Explanation

Simple Explanation

Imagine you run a small shop and want to earn as much money as possible. You can only use limited supplies, like a factory with limited raw materials. The rules about what you can use are called constraints. You draw a map of all allowed choices, and that map has corners. The best earning always happens at one of those corners. Here, checking every corner of our allowed region tells us the highest profit is \( 4000 \), earned when we pick exactly \( x = 4 \) and \( y = 4 \).

Answer: The maximum value of \( Z \) is \( 4000 \), attained at the corner point \( (x, y) = (4, 4) \).

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

Detailed Explanation

In Linear Programming, we want to optimize (maximize or minimize) a linear objective function subject to a set of linear inequalities called constraints. The constraints together define a region in the plane called the feasible region. Every point inside or on the boundary of this region satisfies all constraints. A key theorem tells us that the optimal value of the objective function (if it exists) always occurs at one of the corner points (vertices) of the feasible region. So the graphical method reduces the problem to: draw the region, find its corner points, and test the objective function at each corner. Here we maximize \( Z = 600x + 400y \) subject to \( x + 2y \le 12 \), \( 4x + 5y \ge 20 \), \( 2x + y \le 12 \), and \( x, y \ge 0 \).

Formula Used

Objective function: \( Z = 600x + 400y \). Corner Point Method: evaluate \( Z \) at every vertex of the feasible region; the largest value is the maximum.

Solution

  1. Step 1: Convert each inequality into its boundary line by replacing the inequality sign with an equals sign. The boundary lines are \( x + 2y = 12 \), \( 4x + 5y = 20 \), and \( 2x + y = 12 \), together with the axes \( x = 0 \) and \( y = 0 \). We plot these lines to build the feasible region.
  2. Step 2: Find intercepts of each line to plot them. For \( x + 2y = 12 \): points \( (12, 0) \) and \( (0, 6) \). For \( 4x + 5y = 20 \): points \( (5, 0) \) and \( (0, 4) \). For \( 2x + y = 12 \): points \( (6, 0) \) and \( (0, 12) \).
  3. Step 3: Decide the correct side of each line using the origin test. For \( x + 2y \le 12 \): at \( (0,0) \), \( 0 \le 12 \) is true, so keep the origin side. For \( 2x + y \le 12 \): at \( (0,0) \), \( 0 \le 12 \) is true, so keep the origin side. For \( 4x + 5y \ge 20 \): at \( (0,0) \), \( 0 \ge 20 \) is false, so keep the side away from the origin. Also \( x \ge 0 \) and \( y \ge 0 \) restrict us to the first quadrant.
  4. Step 4: Find the corner points of the feasible region by intersecting the relevant boundary lines. Intersection of \( x + 2y = 12 \) and \( 2x + y = 12 \): multiply the first by 2 to get \( 2x + 4y = 24 \), subtract \( 2x + y = 12 \) to get \( 3y = 12 \), so \( y = 4 \) and \( x = 4 \). This gives \( (4, 4) \). The line \( 4x + 5y = 20 \) forms the lower boundary; it meets the x-axis at \( (5, 0) \) and the y-axis at \( (0, 4) \).
  5. Step 5: List all corner points of the feasible region. On the x-axis, the region runs from \( (5, 0) \) (from \( 4x + 5y = 20 \)) to \( (6, 0) \) (from \( 2x + y = 12 \)). On the y-axis, it runs from \( (0, 4) \) (from \( 4x + 5y = 20 \)) to \( (0, 6) \) (from \( x + 2y = 12 \)). The interior corner from the two upper lines is \( (4, 4) \). So the corner points are \( (5, 0) \), \( (6, 0) \), \( (4, 4) \), \( (0, 6) \), and \( (0, 4) \).
  6. Step 6: Evaluate \( Z = 600x + 400y \) at each corner point. At \( (5, 0) \): \( Z = 600(5) + 400(0) = 3000 \). At \( (6, 0) \): \( Z = 600(6) + 400(0) = 3600 \). At \( (4, 4) \): \( Z = 600(4) + 400(4) = 2400 + 1600 = 4000 \). At \( (0, 6) \): \( Z = 600(0) + 400(6) = 2400 \). At \( (0, 4) \): \( Z = 600(0) + 400(4) = 1600 \).
  7. Step 7: Compare the values of \( Z \): \( 3000, 3600, 4000, 2400, 1600 \). The largest value is \( 4000 \), which occurs at the corner point \( (4, 4) \).

Final Answer

The maximum value of \( Z \) is \( 4000 \), attained at the corner point \( (x, y) = (4, 4) \).

Common Mistake

A very common mistake is shading the wrong side for the constraint \( 4x + 5y \ge 20 \). Since the origin test gives \( 0 \ge 20 \), which is false, this constraint keeps the region AWAY from the origin, not toward it. Mixing up the direction changes the corner points and gives a wrong answer.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Replace each inequality with its boundary equation to get the lines to plot. The three boundary lines are \( x + 2y = 12 \), \( 4x + 5y = 20 \), and \( 2x + y = 12 \), along with the non-negativity axes \( x = 0 \) and \( y = 0 \). — Reason: Converting inequalities to equations lets us draw the boundary lines that form the edges of the feasible region.
  2. Step 2: Find the axis intercepts of each boundary line so they can be drawn accurately. For \( x + 2y = 12 \): set \( y = 0 \) to get \( (12, 0) \) and set \( x = 0 \) to get \( (0, 6) \). For \( 4x + 5y = 20 \): intercepts are \( (5, 0) \) and \( (0, 4) \). For \( 2x + y = 12 \): intercepts are \( (6, 0) \) and \( (0, 12) \). — Reason: Two points uniquely determine a straight line, so intercepts give the quickest way to draw each boundary.
  3. Step 3: Shade the correct half-plane for each constraint. Test the origin \( (0, 0) \) in each inequality. For \( x + 2y \le 12 \): \( 0 + 0 = 0 \le 12 \) — origin satisfies it, shade toward the origin. For \( 4x + 5y \ge 20 \): \( 0 + 0 = 0 \not\ge 20 \) — origin does NOT satisfy it, shade away from the origin. For \( 2x + y \le 12 \): \( 0 + 0 = 0 \le 12 \) — origin satisfies it, shade toward the origin. The feasible region is the overlap of all shaded areas together with \( x \ge 0 \) and \( y \ge 0 \). — Reason: Each constraint eliminates one half of the plane; the feasible region is where all constraints are satisfied simultaneously.
  4. Step 4: Identify the corner points of the feasible region by solving pairs of boundary lines simultaneously. The vertices are found as follows. Intersection of \( 2x + y = 12 \) with the x-axis (\( y = 0 \)): gives \( (6, 0) \). Intersection of \( x + 2y = 12 \) with the y-axis (\( x = 0 \)): gives \( (0, 6) \). Intersection of \( 4x + 5y = 20 \) with the x-axis: gives \( (5, 0) \). Intersection of \( 4x + 5y = 20 \) with the y-axis: gives \( (0, 4) \). Intersection of \( x + 2y = 12 \) and \( 2x + y = 12 \): subtracting the first from twice the second gives \( 3x = 12 \), so \( x = 4 \); substituting back, \( 2(4) + y = 12 \Rightarrow y = 4 \), giving \( (4, 4) \). After checking which of these lie inside (or on the boundary of) the feasible region, the valid corner points are \( (0, 4) \), \( (0, 6) \), \( (4, 4) \), and \( (6, 0) \). — Reason: By the Corner Point Theorem, the optimal value of \( Z \) must occur at one of these vertices.
  5. Step 5: Evaluate the objective function \( Z = 600x + 400y \) at each corner point. At \( (0, 4) \): \( Z = 600(0) + 400(4) = 1600 \). At \( (0, 6) \): \( Z = 600(0) + 400(6) = 2400 \). At \( (4, 4) \): \( Z = 600(4) + 400(4) = 2400 + 1600 = 4000 \). At \( (6, 0) \): \( Z = 600(6) + 400(0) = 3600 \). — Reason: Since the optimal value must occur at a corner point, evaluating \( Z \) at all vertices and comparing is sufficient to find the maximum.
  6. Step 6: Compare all computed values: \( 1600 < 2400 < 3600 < 4000 \). The largest value is \( 4000 \), achieved at the corner point \( (4, 4) \). — Reason: The greatest value among all corner-point evaluations gives the maximum of \( Z \) over the entire feasible region.

Final Answer

The maximum value of \( Z \) is \( 4000 \), attained at the corner point \( (x, y) = (4, 4) \).

Common Mistake

One common mistake: students sometimes shade the wrong side of a boundary line (for example, shading toward the origin for \( 4x + 5y \ge 20 \), when the origin does not satisfy this inequality), which leads to an incorrect feasible region and wrong corner points.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Boundary intercepts — \( x + 2y = 12 \): \( (12,0),(0,6) \); \( 2x + y = 12 \): \( (6,0),(0,12) \); \( 4x + 5y = 20 \): \( (5,0),(0,4) \).
  2. Step 2: Corner points of feasible region: \( (5,0) \), \( (6,0) \), \( (4,4) \), \( (0,6) \), \( (0,4) \).
  3. Step 3: Evaluate \( Z = 600x + 400y \) at each vertex: \( (5,0)\to 3000 \), \( (6,0)\to 3600 \), \( (4,4)\to 4000 \), \( (0,6)\to 2400 \), \( (0,4)\to 1600 \).

Answer: The maximum value of \( Z \) is \( 4000 \), attained at the corner point \( (x, y) = (4, 4) \).

➕ More Examples

More Examples

Example 1

Question: Solve the following Linear Programming Problem graphically: Maximize \( Z = 500x + 300y \) Subject to constraints: \[ x + y \le 10 \] \[ 3x + y \ge 9 \] \[ x + 2y \le 14 \] \[ x, y \ge 0 \]

Solution: We identify the constraints and plot each boundary line. Constraint 1: \( x + y = 10 \) passes through \( (10, 0) \) and \( (0, 10) \). Constraint 2: \( 3x + y = 9 \) passes through \( (3, 0) \) and \( (0, 9) \). Constraint 3: \( x + 2y = 14 \) passes through \( (14, 0) \) and \( (0, 7) \). With \( x \ge 0 \) and \( y \ge 0 \), the feasible region lies in the first quadrant, above the line \( 3x + y = 9 \), and below (or on) the lines \( x + y = 10 \) and \( x + 2y = 14 \). Finding corner points: Corner A: Intersection of \( x + y = 10 \) and \( x = 0 \): point \( (0, 10) \). Check \( x + 2y = 0 + 20 = 20 > 14 \), so \( (0, 10) \) violates constraint 3. So this is not in the feasible region. Let us find the vertices systematically by intersecting boundary lines within the feasible region. Point P: Intersection of \( 3x + y = 9 \) and \( x = 0 \): \[ y = 9, \quad x = 0 \] Check \( x + y = 9 \le 10 \) and \( x + 2y = 18 > 14 \). This violates constraint 3. Not feasible. Point P: Intersection of \( 3x + y = 9 \) and \( y = 0 \): \[ x = 3, \quad y = 0 \] Check \( x + y = 3 \le 10 \) and \( x + 2y = 3 \le 14 \). Feasible. Corner point \( (3, 0) \). Point Q: Intersection of \( x + 2y = 14 \) and \( y = 0 \): \[ x = 14, \quad y = 0 \] Check \( x + y = 14 > 10 \). Not feasible. Point Q: Intersection of \( x + y = 10 \) and \( x + 2y = 14 \): Subtracting the first from the second: \( y = 4 \), then \( x = 6 \). Check \( 3x + y = 18 + 4 = 22 \ge 9 \). Feasible. Corner point \( (6, 4) \). Point R: Intersection of \( x + y = 10 \) and \( 3x + y = 9 \): Subtracting: \( 2x = -1 \), so \( x = -0.5 \). Not feasible (\( x < 0 \)). Point S: Intersection of \( 3x + y = 9 \) and \( x + 2y = 14 \): From first equation: \( y = 9 - 3x \). Substituting: \[ x + 2(9 - 3x) = 14 \] \[ x + 18 - 6x = 14 \] \[ -5x = -4 \] \[ x = \frac{4}{5} = 0.8, \quad y = 9 - 3(0.8) = 9 - 2.4 = 6.6 \] Check \( x + y = 7.4 \le 10 \). Feasible. Corner point \( (0.8, 6.6) \). Point T: On \( y \)-axis with \( 3x + y \ge 9 \): at \( x = 0 \), need \( y \ge 9 \). But \( x + 2y \le 14 \) gives \( y \le 7 \). No feasible point on the \( y \)-axis. So the feasible region has vertices: \( (3, 0) \), \( (6, 4) \), and \( (0.8, 6.6) \). Also check \( (10, 0) \): \( 3(10) + 0 = 30 \ge 9 \), \( 10 + 0 = 10 \le 10 \), \( 10 + 0 = 10 \le 14 \). Feasible! Corner point \( (10, 0) \). Updated vertices: \( (3, 0) \), \( (10, 0) \), \( (6, 4) \), and \( (0.8, 6.6) \). Now evaluate \( Z = 500x + 300y \) at each corner: At \( (3, 0) \): \[ Z = 500(3) + 300(0) = 1500 \] At \( (10, 0) \): \[ Z = 500(10) + 300(0) = 5000 \] At \( (6, 4) \): \[ Z = 500(6) + 300(4) = 3000 + 1200 = 4200 \] At \( (0.8, 6.6) \): \[ Z = 500(0.8) + 300(6.6) = 400 + 1980 = 2380 \] The maximum value of Z is 5000 at \( (10, 0) \).

Answer: Maximum \( Z = 5000 \) at \( x = 10,\ y = 0 \).

Example 2

Question: Solve the following Linear Programming Problem graphically: Maximize \( Z = 400x + 700y \) Subject to constraints: \[ 2x + 3y \le 18 \] \[ x + 5y \ge 10 \] \[ 3x + y \le 15 \] \[ x, y \ge 0 \]

Solution: We plot the boundary lines of all constraints. Line 1: \( 2x + 3y = 18 \) passes through \( (9, 0) \) and \( (0, 6) \). Line 2: \( x + 5y = 10 \) passes through \( (10, 0) \) and \( (0, 2) \). Line 3: \( 3x + y = 15 \) passes through \( (5, 0) \) and \( (0, 15) \). The feasible region satisfies \( 2x + 3y \le 18 \), \( x + 5y \ge 10 \), \( 3x + y \le 15 \), and \( x, y \ge 0 \). Finding corner points: Point A: Intersection of \( x + 5y = 10 \) and \( y = 0 \): \[ x = 10, \quad y = 0 \] Check \( 2(10) + 3(0) = 20 > 18 \). Not feasible. Point A: Intersection of \( x + 5y = 10 \) and \( 3x + y = 15 \): From the second equation: \( y = 15 - 3x \). Substituting: \[ x + 5(15 - 3x) = 10 \] \[ x + 75 - 15x = 10 \] \[ -14x = -65 \] \[ x = \frac{65}{14} \approx 4.64, \quad y = 15 - 3 \times \frac{65}{14} = 15 - \frac{195}{14} = \frac{210 - 195}{14} = \frac{15}{14} \approx 1.07 \] Check \( 2x + 3y = 2 \times \frac{65}{14} + 3 \times \frac{15}{14} = \frac{130 + 45}{14} = \frac{175}{14} = 12.5 \le 18 \). Feasible. Corner point \( \left(\frac{65}{14}, \frac{15}{14}\right) \). Point B: Intersection of \( 3x + y = 15 \) and \( 2x + 3y = 18 \): From first: \( y = 15 - 3x \). Substituting: \[ 2x + 3(15 - 3x) = 18 \] \[ 2x + 45 - 9x = 18 \] \[ -7x = -27 \] \[ x = \frac{27}{7} \approx 3.86, \quad y = 15 - 3 \times \frac{27}{7} = 15 - \frac{81}{7} = \frac{105 - 81}{7} = \frac{24}{7} \approx 3.43 \] Check \( x + 5y = \frac{27}{7} + \frac{120}{7} = \frac{147}{7} = 21 \ge 10 \). Feasible. Corner point \( \left(\frac{27}{7}, \frac{24}{7}\right) \). Point C: Intersection of \( 2x + 3y = 18 \) and \( x = 0 \): \[ y = 6, \quad x = 0 \] Check \( x + 5y = 30 \ge 10 \) and \( 3x + y = 6 \le 15 \). Feasible. Corner point \( (0, 6) \). Point D: Intersection of \( 3x + y = 15 \) and \( x = 0 \): \[ y = 15, \quad x = 0 \] Check \( 2(0) + 3(15) = 45 > 18 \). Not feasible. Point D: Intersection of \( x + 5y = 10 \) and \( x = 0 \): \[ y = 2, \quad x = 0 \] Check \( 2(0) + 3(2) = 6 \le 18 \) and \( 3(0) + 2 = 2 \le 15 \). Feasible. Corner point \( (0, 2) \). So the feasible region has corner points: \( (0, 2) \), \( \left(\frac{65}{14}, \frac{15}{14}\right) \), \( \left(\frac{27}{7}, \frac{24}{7}\right) \), and \( (0, 6) \). Now evaluate \( Z = 400x + 700y \) at each corner: At \( (0, 2) \): \[ Z = 400(0) + 700(2) = 1400 \] At \( \left(\frac{65}{14}, \frac{15}{14}\right) \): \[ Z = 400 \times \frac{65}{14} + 700 \times \frac{15}{14} = \frac{26000}{14} + \frac{10500}{14} = \frac{36500}{14} \approx 2607 \] At \( \left(\frac{27}{7}, \frac{24}{7}\right) \): \[ Z = 400 \times \frac{27}{7} + 700 \times \frac{24}{7} = \frac{10800}{7} + \frac{16800}{7} = \frac{27600}{7} \approx 3943 \] At \( (0, 6) \): \[ Z = 400(0) + 700(6) = 4200 \] The maximum value of Z is 4200 at \( (0, 6) \).

Answer: Maximum \( Z = 4200 \) at \( x = 0,\ y = 6 \).

🎯 Try a Similar Question

Try a Similar Question

Question: Solve the following Linear Programming Problem graphically: Maximise \ \( Z = 500x + 300y \) Subject to the constraints: \[ x + 2y \le 10 \] \[ 3x + y \le 12 \] \[ x + y \ge 4 \] \[ x \ge 0, \quad y \ge 0 \]

Solution

  1. Step 1: Convert constraints to equations for boundary lines: Draw the boundary lines of the feasible region by treating each inequality as an equality: Line 1: \( x + 2y = 10 \) Line 2: \( 3x + y = 12 \) Line 3: \( x + y = 4 \) Also note the non-negativity constraints \( x \ge 0 \) and \( y \ge 0 \).
  2. Step 2: Find intercepts of each line: For Line 1 \( (x + 2y = 10) \): when \( x = 0 \), \( y = 5 \); when \( y = 0 \), \( x = 10 \). Intercepts: \( (0, 5) \) and \( (10, 0) \). For Line 2 \( (3x + y = 12) \): when \( x = 0 \), \( y = 12 \); when \( y = 0 \), \( x = 4 \). Intercepts: \( (0, 12) \) and \( (4, 0) \). For Line 3 \( (x + y = 4) \): when \( x = 0 \), \( y = 4 \); when \( y = 0 \), \( x = 4 \). Intercepts: \( (0, 4) \) and \( (4, 0) \).
  3. Step 3: Identify the feasible region: The feasible region satisfies all four conditions simultaneously: \( x + 2y \le 10 \) (region on or below Line 1), \( 3x + y \le 12 \) (region on or below Line 2), \( x + y \ge 4 \) (region on or above Line 3), \( x \ge 0 \) and \( y \ge 0 \) (first quadrant). Shading the appropriate half-planes and taking their intersection gives a bounded feasible region.
  4. Step 4: Find all corner points of the feasible region: Corner points occur at intersections of boundary lines (or with the axes) within the feasible region. Intersection of Line 3 and the y-axis: \( x = 0,\; x + y = 4 \Rightarrow y = 4 \). Point: \( (0, 4) \). Intersection of Line 1 and the y-axis: \( x = 0,\; y = 5 \). Point: \( (0, 5) \). Intersection of Line 1 and Line 2: Solve \( x + 2y = 10 \) and \( 3x + y = 12 \) simultaneously. From Line 1: \( x = 10 - 2y \). Substituting into Line 2: \[ 3(10 - 2y) + y = 12 \] \[ 30 - 6y + y = 12 \] \[ -5y = -18 \] \[ y = \frac{18}{5} = 3.6 \] Then \( x = 10 - 2(3.6) = 10 - 7.2 = 2.8 \). Point: \( (2.8,\; 3.6) \). Intersection of Line 2 and Line 3: Solve \( 3x + y = 12 \) and \( x + y = 4 \) simultaneously. Subtracting Line 3 from Line 2: \( 2x = 8 \Rightarrow x = 4 \). Then \( y = 4 - 4 = 0 \). Point: \( (4, 0) \). Check whether \( (4, 0) \) satisfies Line 1: \( 4 + 0 = 4 \le 10 \). Yes. So the corner points of the feasible region are: \( (0, 4) \), \( (0, 5) \), \( (2.8, 3.6) \), and \( (4, 0) \).
  5. Step 5: Evaluate the objective function at each corner point: The objective function is \( Z = 500x + 300y \). At \( (0, 4) \): \[ Z = 500(0) + 300(4) = 1200 \] At \( (0, 5) \): \[ Z = 500(0) + 300(5) = 1500 \] At \( (2.8,\; 3.6) \): \[ Z = 500(2.8) + 300(3.6) = 1400 + 1080 = 2480 \] At \( (4, 0) \): \[ Z = 500(4) + 300(0) = 2000 \]
  6. Step 6: Identify the maximum value: Comparing all values: \( Z(0, 4) = 1200 \), \( Z(0, 5) = 1500 \), \( Z(2.8, 3.6) = 2480 \), \( Z(4, 0) = 2000 \). The maximum value is \( Z = 2480 \) attained at the corner point \( (2.8,\; 3.6) \), i.e., at \( x = \dfrac{14}{5} \) and \( y = \dfrac{18}{5} \).

Answer: The maximum value of \( Z \) is \( 2480 \), attained at the corner point \( \left(\dfrac{14}{5},\; \dfrac{18}{5}\right) \), i.e., \( (2.8,\; 3.6) \).

Everything you get with Solver7

More questions in Linear Programming