SOLVER7 Study. Nothing Else.
Chapter 12 Examples Q1

Solve the following linear programming problem graphically:
\(\begin{align}\text {Maximise}\ Z = 4x + y&...(1)\\ \text {subject to the constraints:}\\ x + y \le 50&....(2)\\ 3x + y \le 90&....(3)\\ x \ge 0, y \ge 0&...(4)\\ \end{align}\)

CBSE Class 12 Maths · Linear Programming

Solution

👶 Simple Explanation

Simple Explanation

Imagine you are trying to earn as much pocket money as possible, but your parents set some rules about how many chores you can do. The shaded area on the graph shows every allowed combination of chores. The corners of that shaded area are the most interesting spots, because the highest earnings always happen at one of those corners. We simply check each corner and see which one gives the biggest value of Z. The corner at the point where x equals 30 and y equals 0 gives the biggest result of 120.

Answer: The maximum value of \( Z \) is \( 120 \), attained at the corner point \( (30, 0) \), i.e. when \( x = 30 \) and \( y = 0 \).

📖 Maximising Z = 4x + y by Graphical Method

Detailed Explanation

In a Linear Programming Problem (LPP) we optimise a linear objective function subject to linear inequality constraints. The set of all points satisfying every constraint is called the feasible region. When this region is bounded (a closed polygon), the objective function attains its maximum and minimum values at the corner points (vertices) of the region. This is the Corner Point Method. Looking at the figure, the constraints \( x \ge 0 \) and \( y \ge 0 \) restrict us to the first quadrant, while the lines \( 3x + y = 90 \) and \( x + y = 50 \) form the upper boundaries. The shaded region shown is the feasible region with corner points \( O(0,0) \), \( A(30,0) \), \( B(20,30) \) and \( C(0,50) \).

Formula Used

By the Corner Point Method, the optimal value of \( Z = ax + by \) over a bounded feasible region occurs at one of its corner points. Evaluate \( Z \) at each vertex and pick the largest for maximum.

Solution

  1. Step 1: Write the boundary lines: Convert each inequality into an equation to draw its boundary line. \[ x + y = 50 \] \[ 3x + y = 90 \] \[ x = 0, \quad y = 0 \] The feasible region lies on the origin side of each slanted line (since \( 0 \le 50 \) and \( 0 \le 90 \) are true) and in the first quadrant.
  2. Step 2: Find intercepts to plot the lines: For \( x + y = 50 \): when \( x = 0, y = 50 \); when \( y = 0, x = 50 \). For \( 3x + y = 90 \): when \( x = 0, y = 90 \); when \( y = 0, x = 30 \). These match the points \( (50,0) \) and \( (30,0) \) marked in the figure.
  3. Step 3: Find the intersection point B: The two slanted lines meet where both equations hold. Subtract \( x + y = 50 \) from \( 3x + y = 90 \): \[ (3x + y) - (x + y) = 90 - 50 \] \[ 2x = 40 \] \[ x = 20 \] Substitute back into \( x + y = 50 \): \[ 20 + y = 50 \] \[ y = 30 \] So the intersection is \( B(20, 30) \), as shown in the diagram.
  4. Step 4: List the corner points: The bounded feasible region (shaded blue) has four vertices: \[ O(0,0), \quad A(30,0), \quad B(20,30), \quad C(0,50) \] Note that \( A \) is \( (30,0) \), the x-intercept of \( 3x + y = 90 \), which is the binding constraint here.
  5. Step 5: Evaluate Z at each corner point: Substitute each vertex into \( Z = 4x + y \). At \( O(0,0) \): \[ Z = 4(0) + 0 = 0 \] At \( A(30,0) \): \[ Z = 4(30) + 0 = 120 \] At \( B(20,30) \): \[ Z = 4(20) + 30 = 110 \] At \( C(0,50) \): \[ Z = 4(0) + 50 = 50 \]
  6. Step 6: Compare and choose the maximum: Comparing the values \( 0, 120, 110, 50 \), the largest is \( 120 \), which occurs at \( A(30, 0) \). This matches the table in the figure where \( 120 \) is marked as Maximum.

Final Answer

The maximum value of \( Z \) is \( 120 \), attained at the corner point \( (30, 0) \), i.e. when \( x = 30 \) and \( y = 0 \).

Common Mistake

A common mistake is to forget to check the intersection point \( B(20,30) \) or to assume the maximum must be at the point where the objective line has the largest intercept. You must evaluate \( Z \) at every corner point and compare; here \( B \) gives \( 110 \) which is close to but less than the true maximum \( 120 \) at \( A \).

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Write the boundary equations from the constraints. Convert each inequality into its boundary line: \[ x + y = 50 \] \[ 3x + y = 90 \] along with the non-negativity restrictions \( x \ge 0 \) and \( y \ge 0 \). — Reason: Boundary lines define the edges of the feasible region, so we must identify them before we can find corner points.
  2. Step 2: Find the axis intercepts of each boundary line to help sketch the region. For \( x + y = 50 \): set \( x = 0 \) to get \( y = 50 \), and set \( y = 0 \) to get \( x = 50 \). For \( 3x + y = 90 \): set \( x = 0 \) to get \( y = 90 \), and set \( y = 0 \) to get \( x = 30 \). — Reason: Intercepts give two easy-to-plot points on each line, making it straightforward to draw the boundaries accurately.
  3. Step 3: Determine which side of each boundary satisfies the constraint by testing the origin \( (0, 0) \). For \( x + y \le 50 \): \( 0 + 0 = 0 \le 50 \) — true, so the origin side is feasible. For \( 3x + y \le 90 \): \( 0 + 0 = 0 \le 90 \) — true, so again the origin side is feasible. Combined with \( x \ge 0 \) and \( y \ge 0 \), the feasible region lies in the first quadrant on the origin side of both slanted lines. — Reason: We need to know which half-plane each inequality represents so we shade the correct region.
  4. Step 4: Identify all four corner points of the bounded feasible region from the graph: \( O = (0, 0) \), \( A = (30, 0) \), \( B = (20, 30) \), and \( C = (0, 50) \). The intersection point \( B \) is found by solving the two lines simultaneously: subtracting \( x + y = 50 \) from \( 3x + y = 90 \) gives \( 2x = 40 \), so \( x = 20 \), and then \( y = 50 - 20 = 30 \). — Reason: Corner points are where the boundary lines meet; these are the only candidates for the optimum value by the Corner Point Method.
  5. Step 5: Evaluate the objective function \( Z = 4x \) at each corner point (noting that the coefficient of \( y \) is \( 0 \), so only \( x \) matters). At \( O(0, 0) \): \( Z = 4(0) = 0 \). At \( A(30, 0) \): \( Z = 4(30) = 120 \). At \( B(20, 30) \): \( Z = 4(20) = 80 \). At \( C(0, 50) \): \( Z = 4(0) = 0 \). — Reason: The Corner Point Theorem guarantees the optimal value lies at one of these vertices, so we must check all of them without skipping any.
  6. Step 6: Compare the four values: \( 0, 120, 80, 0 \). The largest is \( 120 \), achieved at \( A(30, 0) \). — Reason: The maximum of the objective function over the bounded feasible region is the greatest among all corner-point values.

Final Answer

The maximum value of \( Z \) is \( 120 \), attained at the corner point \( (30, 0) \), i.e. when \( x = 30 \) and \( y = 0 \).

Common Mistake

One common mistake: students sometimes forget to check ALL corner points and only evaluate Z at two or three vertices — this risks missing the true maximum. Always evaluate Z at every vertex of the feasible region before concluding.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Corner points of the feasible region: \( O(0,0) \), \( A(30,0) \), \( B(20,30) \), \( C(0,50) \).
  2. Step 2: Evaluate \( Z = 4x \) at each vertex: \( Z(O) = 0 \), \( Z(A) = 4(30) = 120 \), \( Z(B) = 4(20) = 80 \), \( Z(C) = 4(0) = 0 \).
  3. Step 3: Maximum value: \( Z = 120 \) at \( A(30, 0) \).

Answer: The maximum value of \( Z \) is \( 120 \), attained at the corner point \( (30, 0) \), i.e. when \( x = 30 \) and \( y = 0 \).

➕ More Examples

More Examples

Example 1

Question: Solve the following linear programming problem graphically: Maximise \( Z = 5x + 3y \) subject to the constraints: \[ x + y \le 60 \] \[ 2x + y \le 90 \] \[ x \ge 0,\quad y \ge 0 \]

Solution: We need to maximise \( Z = 5x + 3y \) subject to the given constraints. First, find the boundary lines and their intercepts. For constraint \( x + y = 60 \): when \( x = 0 \), \( y = 60 \); when \( y = 0 \), \( x = 60 \). For constraint \( 2x + y = 90 \): when \( x = 0 \), \( y = 90 \); when \( y = 0 \), \( x = 45 \). The feasible region is bounded by these lines and the non-negativity constraints \( x \ge 0 \) and \( y \ge 0 \). Next, find the corner points of the feasible region. Corner point A is at the origin: \( (0, 0) \). Corner point B is where \( 2x + y = 90 \) meets the x-axis: \( (45, 0) \). Corner point C is the intersection of \( x + y = 60 \) and \( 2x + y = 90 \). Subtracting the first from the second: \[ (2x + y) - (x + y) = 90 - 60 \] \[ x = 30 \] Substituting back: \( 30 + y = 60 \), so \( y = 30 \). Corner point C is \( (30, 30) \). Corner point D is where \( x + y = 60 \) meets the y-axis: \( (0, 60) \). Now evaluate \( Z = 5x + 3y \) at each corner point. At \( A(0, 0) \): \[ Z = 5(0) + 3(0) = 0 \] At \( B(45, 0) \): \[ Z = 5(45) + 3(0) = 225 \] At \( C(30, 30) \): \[ Z = 5(30) + 3(30) = 150 + 90 = 240 \] At \( D(0, 60) \): \[ Z = 5(0) + 3(60) = 180 \] The maximum value of \( Z \) is 240, achieved at \( (30, 30) \).

Answer: Maximum value of \( Z = 240 \) at \( x = 30,\ y = 30 \).

Example 2

Question: Solve the following linear programming problem graphically: Maximise \( Z = 3x + 5y \) subject to the constraints: \[ x + 2y \le 80 \] \[ 3x + 2y \le 120 \] \[ x \ge 0,\quad y \ge 0 \]

Solution: We need to maximise \( Z = 3x + 5y \) subject to the given constraints. First, find the boundary lines and their intercepts. For constraint \( x + 2y = 80 \): when \( x = 0 \), \( y = 40 \); when \( y = 0 \), \( x = 80 \). For constraint \( 3x + 2y = 120 \): when \( x = 0 \), \( y = 60 \); when \( y = 0 \), \( x = 40 \). The feasible region satisfies both constraints along with \( x \ge 0 \) and \( y \ge 0 \). Identify the corner points of the feasible region. Corner point A is at the origin: \( (0, 0) \). Corner point B is where \( 3x + 2y = 120 \) meets the x-axis: \( (40, 0) \). Corner point C is the intersection of \( x + 2y = 80 \) and \( 3x + 2y = 120 \). Subtracting the first equation from the second: \[ (3x + 2y) - (x + 2y) = 120 - 80 \] \[ 2x = 40 \] \[ x = 20 \] Substituting back: \( 20 + 2y = 80 \), so \( 2y = 60 \), giving \( y = 30 \). Corner point C is \( (20, 30) \). Corner point D is where \( x + 2y = 80 \) meets the y-axis: \( (0, 40) \). Note: The point \( (0, 60) \) from the second constraint lies outside the feasible region because it violates \( x + 2y \le 80 \) (check: \( 0 + 120 = 120 > 80 \)). Now evaluate \( Z = 3x + 5y \) at each corner point. At \( A(0, 0) \): \[ Z = 3(0) + 5(0) = 0 \] At \( B(40, 0) \): \[ Z = 3(40) + 5(0) = 120 \] At \( C(20, 30) \): \[ Z = 3(20) + 5(30) = 60 + 150 = 210 \] At \( D(0, 40) \): \[ Z = 3(0) + 5(40) = 200 \] The maximum value of \( Z \) is 210, achieved at \( (20, 30) \).

Answer: Maximum value of \( Z = 210 \) at \( x = 20,\ y = 30 \).

🎯 Try a Similar Question

Try a Similar Question

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

Solution

  1. Step 1: Identify the constraints and objective function: Objective function: \( Z = 5x + 3y \). Constraints: \( x + y \le 60 \), \( 2x + y \le 90 \), \( x \ge 0 \), \( y \ge 0 \).
  2. Step 2: Find the boundary lines: Treat each inequality as an equality to find intercepts. For \( x + y = 60 \): when \( x = 0 \), \( y = 60 \); when \( y = 0 \), \( x = 60 \). For \( 2x + y = 90 \): when \( x = 0 \), \( y = 90 \); when \( y = 0 \), \( x = 45 \).
  3. Step 3: Find the intersection point of the two lines: Solve simultaneously: \( x + y = 60 \) and \( 2x + y = 90 \). Subtracting the first equation from the second gives \( x = 30 \). Substituting back: \( 30 + y = 60 \), so \( y = 30 \). Intersection point: \( (30, 30) \).
  4. Step 4: Identify the corner points of the feasible region: The feasible region is bounded by the axes and the two lines. Its corner points are: \( O(0, 0) \), \( A(45, 0) \), \( B(30, 30) \), and \( C(0, 60) \).
  5. Step 5: Evaluate Z at each corner point: At \( O(0, 0) \): \( Z = 5(0) + 3(0) = 0 \). At \( A(45, 0) \): \( Z = 5(45) + 3(0) = 225 \). At \( B(30, 30) \): \( Z = 5(30) + 3(30) = 150 + 90 = 240 \). At \( C(0, 60) \): \( Z = 5(0) + 3(60) = 180 \).
  6. Step 6: Determine the maximum value: Comparing all values: \( Z = 0, 225, 240, 180 \). The maximum value is \( Z = 240 \), attained at corner point \( B(30, 30) \).

Answer: The maximum value of \( Z \) is \( 240 \), attained at the corner point \( (30, 30) \), i.e. when \( x = 30 \) and \( y = 30 \).

Everything you get with Solver7

More questions in Linear Programming