SOLVER7 Study. Nothing Else.
Exercise 12.1 Q5

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

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 have rules about how much of each item you can sell. Draw those rules as lines on a graph. The safe zone where all rules are satisfied is called the feasible region. The best earning always happens at a corner of that safe zone. Check every corner, calculate the earnings using \( Z = 3x + 2y \), and pick the biggest value. Here, the corner \( (4, 3) \) gives the highest value of \( 18 \).

Answer: The maximum value of \( Z \) is \( 18 \), attained at the point \( (4, 3) \), that is at \( x = 4 \) and \( y = 3 \).

📖 Maximise Z = 3x + 2y Graphically

Detailed Explanation

In Linear Programming, we optimise (maximise or minimise) a linear objective function subject to a set of linear inequalities called constraints. When we plot these constraints on a graph, they carve out a common shaded region called the feasible region, which contains all points satisfying every constraint at once. A key result (the Corner Point Theorem) tells us that if an optimal value of the objective function exists, it always occurs at a corner (vertex) of the feasible region. So instead of checking infinitely many points, we only need to evaluate the objective function \( Z = 3x + 2y \) at each corner point and pick the best value.

Formula Used

Objective function: \( Z = 3x + 2y \). Evaluate \( Z \) at each corner point of the feasible region; the maximum value of \( Z \) is the largest of these values.

Solution

  1. Step 1: Write the constraints as boundary lines: Convert each inequality into an equation to draw its boundary line. \[ x + 2y = 10 \] \[ 3x + y = 15 \] Also we have the non-negativity conditions \( x \ge 0 \) and \( y \ge 0 \), which restrict us to the first quadrant.
  2. Step 2: Find intercepts to plot the lines: For \( x + 2y = 10 \): putting \( x = 0 \) gives \( y = 5 \), and putting \( y = 0 \) gives \( x = 10 \). So it passes through \( (0, 5) \) and \( (10, 0) \). For \( 3x + y = 15 \): putting \( x = 0 \) gives \( y = 15 \), and putting \( y = 0 \) gives \( x = 5 \). So it passes through \( (0, 15) \) and \( (5, 0) \).
  3. Step 3: Identify the correct side of each inequality: Test the origin \( (0,0) \) in each constraint. For \( x + 2y \le 10 \): \( 0 \le 10 \) is true, so shade the side containing the origin. For \( 3x + y \le 15 \): \( 0 \le 15 \) is true, so again shade the origin side. Combined with \( x \ge 0 \) and \( y \ge 0 \), the feasible region is a bounded region in the first quadrant.
  4. Step 4: Find the point of intersection of the two lines: Solve the two equations together. From \( 3x + y = 15 \) we get \( y = 15 - 3x \). Substitute into \( x + 2y = 10 \): \[ x + 2(15 - 3x) = 10 \] \[ x + 30 - 6x = 10 \] \[ -5x = -20 \] \[ x = 4 \] Then \( y = 15 - 3(4) = 3 \). So the lines meet at \( (4, 3) \).
  5. Step 5: List the corner points of the feasible region: The vertices of the feasible region are the origin, the intercepts on the axes that lie in the region, and the intersection point. These are \( (0, 0) \), \( (5, 0) \), \( (4, 3) \), and \( (0, 5) \).
  6. Step 6: Evaluate Z at each corner point: At \( (0, 0) \): \( Z = 3(0) + 2(0) = 0 \). At \( (5, 0) \): \( Z = 3(5) + 2(0) = 15 \). At \( (4, 3) \): \( Z = 3(4) + 2(3) = 12 + 6 = 18 \). At \( (0, 5) \): \( Z = 3(0) + 2(5) = 10 \).
  7. Step 7: Choose the maximum value: Comparing all values of \( Z \), namely \( 0, 15, 18, 10 \), the largest is \( 18 \), which occurs at the corner point \( (4, 3) \).

Final Answer

The maximum value of \( Z \) is \( 18 \), attained at the point \( (4, 3) \), that is at \( x = 4 \) and \( y = 3 \).

Common Mistake

A common mistake is forgetting to include \( (5, 0) \) instead of \( (10, 0) \) as a corner point. Since \( 3x + y \le 15 \) is more restrictive on the x-axis, the feasible boundary point on the x-axis is \( (5, 0) \), not \( (10, 0) \). Always check that each chosen vertex actually satisfies every constraint before evaluating \( Z \).

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Convert each inequality constraint into its boundary equation so the lines can be plotted. The two boundary lines are \[ x + 2y = 10 \] and \[ 3x + y = 15 \] Along with the non-negativity restrictions \( x \ge 0 \) and \( y \ge 0 \), these lines enclose the feasible region in the first quadrant. — Reason: Plotting the boundary lines first is the standard way to visualise which region satisfies all constraints simultaneously.
  2. Step 2: Find the intercepts of each boundary line to draw them accurately. For \( x + 2y = 10 \): setting \( x = 0 \) gives \( y = 5 \), and setting \( y = 0 \) gives \( x = 10 \), so this line passes through \( (0, 5) \) and \( (10, 0) \). For \( 3x + y = 15 \): setting \( x = 0 \) gives \( y = 15 \), and setting \( y = 0 \) gives \( x = 5 \), so this line passes through \( (0, 15) \) and \( (5, 0) \). — Reason: Two points are sufficient to draw a straight line; intercepts are the quickest to compute.
  3. Step 3: Identify the corner points of the feasible region. The feasible region is bounded by the two lines and the axes, giving four vertices: \( (0, 0) \), \( (5, 0) \), \( (4, 3) \) (intersection of the two lines, found below), and \( (0, 5) \). To find the intersection, solve the system simultaneously. From \( 3x + y = 15 \), write \( y = 15 - 3x \). Substituting into \( x + 2y = 10 \): \[ x + 2(15 - 3x) = 10 \] \[ x + 30 - 6x = 10 \] \[ -5x = -20 \] \[ x = 4 \] Then \( y = 15 - 3(4) = 3 \), giving the intersection point \( (4, 3) \). — Reason: By the Corner Point Theorem, the maximum of \( Z \) must occur at one of these vertices, so we need their exact coordinates.
  4. Step 4: Evaluate the objective function \( Z = 3x + 2y \) at each corner point. At \( (0, 0) \): \[ Z = 3(0) + 2(0) = 0 \] At \( (5, 0) \): \[ Z = 3(5) + 2(0) = 15 \] At \( (4, 3) \): \[ Z = 3(4) + 2(3) = 12 + 6 = 18 \] At \( (0, 5) \): \[ Z = 3(0) + 2(5) = 10 \] — Reason: Checking only the corner points (instead of infinitely many feasible points) is valid because the objective function is linear and its extreme values always occur at vertices.
  5. Step 5: Compare the values of \( Z \) obtained: \( 0, 15, 18, 10 \). The largest value is \( 18 \), achieved at the vertex \( (4, 3) \). — Reason: The maximum of the objective function over the feasible region is simply the greatest among the values computed at all corner points.

Final Answer

The maximum value of \( Z \) is \( 18 \), attained at the point \( (4, 3) \), that is at \( x = 4 \) and \( y = 3 \).

Common Mistake

One common mistake: students sometimes forget to include the origin \( (0, 0) \) as a corner point, or they miss identifying all vertices of the feasible region, leading them to overlook the true maximum or minimum.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Corner Points of Feasible Region: Boundary lines: \( x + 2y = 10 \) and \( 3x + y = 15 \). Corner points (with \( x \ge 0,\, y \ge 0 \)): \( (0, 0) \), \( (5, 0) \), \( (0, 5) \), and intersection point \( (4, 3) \) (from solving the two equations simultaneously).
  2. Step 2: Evaluate Z at Each Corner: At \( (0,0) \): \( Z = 0 \). At \( (5,0) \): \( Z = 15 \). At \( (0,5) \): \( Z = 10 \). At \( (4,3) \): \( Z = 3(4) + 2(3) = 12 + 6 = 18 \).

Answer: The maximum value of \( Z \) is \( 18 \), attained at the point \( (4, 3) \), that is at \( x = 4 \) and \( y = 3 \).

➕ More Examples

More Examples

Example 1

Question: Solve the following Linear Programming Problem graphically: Maximise \( Z = 5x + 4y \) subject to the constraints \( x + y \le 8 \), \( 2x + y \le 12 \), \( x \ge 0 \), \( y \ge 0 \).

Solution: Step 1: Convert each constraint inequality to an equation and find intercepts. For \( x + y = 8 \): when \( x = 0 \), \( y = 8 \); when \( y = 0 \), \( x = 8 \). Points: \( (0, 8) \) and \( (8, 0) \). For \( 2x + y = 12 \): when \( x = 0 \), \( y = 12 \); when \( y = 0 \), \( x = 6 \). Points: \( (0, 12) \) and \( (6, 0) \). Step 2: Plot both lines and shade the feasible region satisfying all constraints (including \( x \ge 0 \), \( y \ge 0 \)). Step 3: Find the corner points of the feasible region. Corner O: \( (0, 0) \) Corner A: \( (6, 0) \) (intersection of \( 2x + y = 12 \) with the x-axis) Corner B: intersection of \( x + y = 8 \) and \( 2x + y = 12 \). Subtracting: \( (2x + y) - (x + y) = 12 - 8 \), giving \( x = 4 \). Then \( y = 8 - 4 = 4 \). So Corner B is \( (4, 4) \). Corner C: \( (0, 8) \) (intersection of \( x + y = 8 \) with the y-axis) Step 4: Evaluate \( Z = 5x + 4y \) at each corner point. At \( O(0, 0) \): \[ Z = 5(0) + 4(0) = 0 \] At \( A(6, 0) \): \[ Z = 5(6) + 4(0) = 30 \] At \( B(4, 4) \): \[ Z = 5(4) + 4(4) = 20 + 16 = 36 \] At \( C(0, 8) \): \[ Z = 5(0) + 4(8) = 32 \] Step 5: The maximum value of \( Z \) is \( 36 \), achieved at the corner point \( (4, 4) \).

Answer: Maximum value of \( Z = 36 \) at \( x = 4 \), \( y = 4 \).

Example 2

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

Solution: Step 1: Convert each constraint inequality to an equation and find intercepts. For \( 3x + 2y = 18 \): when \( x = 0 \), \( y = 9 \); when \( y = 0 \), \( x = 6 \). Points: \( (0, 9) \) and \( (6, 0) \). For \( x + 2y = 10 \): when \( x = 0 \), \( y = 5 \); when \( y = 0 \), \( x = 10 \). Points: \( (0, 5) \) and \( (10, 0) \). Step 2: Plot both lines and shade the feasible region satisfying all constraints. Step 3: Find the corner points of the feasible region. Corner O: \( (0, 0) \) Corner A: \( (6, 0) \) (intersection of \( 3x + 2y = 18 \) with the x-axis) Corner B: intersection of \( 3x + 2y = 18 \) and \( x + 2y = 10 \). Subtracting: \( (3x + 2y) - (x + 2y) = 18 - 10 \), giving \( 2x = 8 \), so \( x = 4 \). Substituting into \( x + 2y = 10 \): \( 4 + 2y = 10 \), so \( y = 3 \). Corner B is \( (4, 3) \). Corner C: \( (0, 5) \) (intersection of \( x + 2y = 10 \) with the y-axis) Step 4: Evaluate \( Z = 4x + 6y \) at each corner point. At \( O(0, 0) \): \[ Z = 4(0) + 6(0) = 0 \] At \( A(6, 0) \): \[ Z = 4(6) + 6(0) = 24 \] At \( B(4, 3) \): \[ Z = 4(4) + 6(3) = 16 + 18 = 34 \] At \( C(0, 5) \): \[ Z = 4(0) + 6(5) = 30 \] Step 5: The maximum value of \( Z \) is \( 34 \), achieved at the corner point \( (4, 3) \).

Answer: Maximum value of \( Z = 34 \) at \( x = 4 \), \( y = 3 \).

🎯 Try a Similar Question

Try a Similar Question

Question: Solve the following Linear Programming Problem graphically: Maximise \( Z = 5x + 4y \) subject to the constraints \( x + y \le 8 \), \( 2x + y \le 12 \), \( x \ge 0 \), \( y \ge 0 \).

Solution

  1. Step 1: Identify the Constraints and Objective Function: The objective function is \( Z = 5x + 4y \). The constraints are: \( x + y \le 8 \), \( 2x + y \le 12 \), \( x \ge 0 \), \( y \ge 0 \).
  2. Step 2: Find the Boundary Lines: Convert each inequality to an equation to draw the boundary lines. Line 1: \( x + y = 8 \). It passes through \( (0, 8) \) and \( (8, 0) \). Line 2: \( 2x + y = 12 \). It passes through \( (0, 12) \) and \( (6, 0) \).
  3. Step 3: Find the Corner Points of the Feasible Region: The feasible region is bounded by the two lines and the axes. The corner points are found as follows. Origin: \( (0, 0) \). Intersection of \( x + y = 8 \) with the y-axis: \( (0, 8) \). Intersection of \( 2x + y = 12 \) with the x-axis: \( (6, 0) \). Intersection of the two lines \( x + y = 8 \) and \( 2x + y = 12 \): Subtracting the first from the second gives \( x = 4 \), then \( y = 8 - 4 = 4 \), so the point is \( (4, 4) \).
  4. Step 4: Evaluate Z at Each Corner Point: At \( (0, 0) \): \( Z = 5(0) + 4(0) = 0 \). At \( (6, 0) \): \( Z = 5(6) + 4(0) = 30 \). At \( (4, 4) \): \( Z = 5(4) + 4(4) = 20 + 16 = 36 \). At \( (0, 8) \): \( Z = 5(0) + 4(8) = 32 \).
  5. Step 5: Determine the Maximum Value: Comparing all values: \( Z = 0 \), \( Z = 30 \), \( Z = 36 \), and \( Z = 32 \). The maximum value is \( Z = 36 \), attained at the corner point \( (4, 4) \).

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

Everything you get with Solver7

More questions in Linear Programming