SOLVER7 Study. Nothing Else.
Exercise 12.1 Q3

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

CBSE Class 12 Maths · Linear Programming

Solution

👶 Simple Explanation

Simple Explanation

Imagine you run a small shop making two items, and you want to earn as much money as possible. You only have limited supplies, so you cannot make unlimited amounts. A linear programming problem is like finding the sweetest spot — the exact mix of two things that earns you the most, without breaking any supply limits. Think of it like fitting the biggest possible slice of cake inside a weirdly shaped box. The best answer always hides at a corner of that box, never in the middle.

Answer: The maximum value of \( Z \) is \( \dfrac{235}{19} \approx 12.37 \), attained at the point \( \left( \dfrac{20}{19}, \dfrac{45}{19} \right) \).

📖 Maximising Z = 5x + 3y Graphically

Detailed Explanation

In Linear Programming, we optimise (maximise or minimise) a linear 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 result (the Corner Point Theorem) states that if a maximum or minimum of the objective function exists, it occurs at a corner point (vertex) of the feasible region. So our job is to draw the feasible region, identify all its corner points, and evaluate the objective function at each of them.

Formula Used

Objective function: \( Z = 5x + 3y \). Evaluate \( Z \) at every corner point of the feasible region; the largest value gives the maximum.

Solution

  1. Step 1: Write down the constraints. We must maximise \( Z = 5x + 3y \) subject to \[ 3x + 5y \le 15, \quad 5x + 2y \le 10, \quad x \ge 0, \quad y \ge 0. \] The conditions \( x \ge 0 \) and \( y \ge 0 \) restrict us to the first quadrant.
  2. Step 2: Convert each inequality into an equation to draw the boundary lines. For \( 3x + 5y = 15 \): when \( x = 0 \), \( y = 3 \); when \( y = 0 \), \( x = 5 \). So it passes through \( (0,3) \) and \( (5,0) \). For \( 5x + 2y = 10 \): when \( x = 0 \), \( y = 5 \); when \( y = 0 \), \( x = 2 \). So it passes through \( (0,5) \) and \( (2,0) \).
  3. Step 3: Decide the correct side of each line by testing the origin \( (0,0) \). For \( 3x + 5y \le 15 \): \( 0 \le 15 \) is true, so shade the side containing the origin. For \( 5x + 2y \le 10 \): \( 0 \le 10 \) is true, so again the origin side is shaded. The feasible region is the overlap of these regions in the first quadrant, and it is bounded.
  4. Step 4: Find the corner points of the feasible region. The vertices are \( O(0,0) \), \( A(2,0) \) (x-intercept of \( 5x + 2y = 10 \)), \( C(0,3) \) (y-intercept of \( 3x + 5y = 15 \)), and the point \( B \) where the two lines intersect.
  5. Step 5: Find the intersection point \( B \) by solving \[ 3x + 5y = 15, \quad 5x + 2y = 10. \] Multiply the first by 2 and the second by 5: \[ 6x + 10y = 30, \quad 25x + 10y = 50. \] Subtracting gives \( 19x = 20 \), so \( x = \dfrac{20}{19} \). Substitute into \( 5x + 2y = 10 \): \[ 2y = 10 - 5\cdot\frac{20}{19} = 10 - \frac{100}{19} = \frac{90}{19}. \] Hence \( y = \dfrac{45}{19} \), so \( B = \left( \dfrac{20}{19}, \dfrac{45}{19} \right) \).
  6. Step 6: Evaluate \( Z = 5x + 3y \) at each corner point. At \( O(0,0) \): \( Z = 0 \). At \( A(2,0) \): \( Z = 5(2) + 3(0) = 10 \). At \( C(0,3) \): \( Z = 5(0) + 3(3) = 9 \). At \( B\left(\frac{20}{19}, \frac{45}{19}\right) \): \[ Z = 5\cdot\frac{20}{19} + 3\cdot\frac{45}{19} = \frac{100 + 135}{19} = \frac{235}{19} \approx 12.37. \]
  7. Step 7: Compare all the values of \( Z \): \( 0, \ 10, \ 9, \ \frac{235}{19} \). The largest value is \( \dfrac{235}{19} \), occurring at \( B\left(\dfrac{20}{19}, \dfrac{45}{19}\right) \).

Final Answer

The maximum value of \( Z \) is \( \dfrac{235}{19} \approx 12.37 \), attained at the point \( \left( \dfrac{20}{19}, \dfrac{45}{19} \right) \).

Common Mistake

A frequent error is testing the objective function only at the axis-intercepts and forgetting the intersection point \( B \) of the two constraint lines. Since the maximum here actually occurs at \( B \), missing this corner point leads to the wrong answer \( Z = 10 \) instead of \( \dfrac{235}{19} \).

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: State the Problem Clearly: We want to maximise \( Z = 5x + 3y \) subject to the constraints \[ 3x + 5y \le 15, \quad 5x + 2y \le 10, \quad x \ge 0, \quad y \ge 0. \] Reason: Writing out all constraints first ensures we do not miss any boundary of the feasible region. The conditions \( x \ge 0 \) and \( y \ge 0 \) confine the solution to the first quadrant.
  2. Step 2: Find Intercepts of Each Boundary Line: Convert each inequality to an equation and find its intercepts. For \( 3x + 5y = 15 \): setting \( x = 0 \) gives \( y = 3 \), and setting \( y = 0 \) gives \( x = 5 \), so this line passes through \( (0, 3) \) and \( (5, 0) \). For \( 5x + 2y = 10 \): setting \( x = 0 \) gives \( y = 5 \), and setting \( y = 0 \) gives \( x = 2 \), so this line passes through \( (0, 5) \) and \( (2, 0) \). Reason: Intercepts give us two definite points to draw each boundary line accurately.
  3. Step 3: Identify the Feasible Side of Each Line: Test the origin \( (0, 0) \) in each inequality. For \( 3x + 5y \le 15 \): substituting gives \( 0 \le 15 \), which is true, so the feasible region lies on the same side as the origin. For \( 5x + 2y \le 10 \): substituting gives \( 0 \le 10 \), which is also true, so again the feasible region is on the origin's side. Reason: Testing the origin quickly tells us which half-plane satisfies each constraint, letting us shade the correct region.
  4. Step 4: Find the Corner Points of the Feasible Region: The feasible region is bounded by the two lines and the axes, giving four potential corner points. The corners on the axes are straightforward: \( O = (0, 0) \), \( A = (2, 0) \) (x-intercept of \( 5x + 2y = 10 \)), and \( B = (0, 3) \) (y-intercept of \( 3x + 5y = 15 \)). The fourth corner is where the two lines intersect. To find it, solve simultaneously: \[ 3x + 5y = 15 \] and \[ 5x + 2y = 10. \] Multiply the first equation by 2 and the second by 5: \[ 6x + 10y = 30 \] and \[ 25x + 10y = 50. \] Subtracting the first from the second: \[ 19x = 20 \implies x = \frac{20}{19}. \] Substituting back into \( 5x + 2y = 10 \): \[ 5 \cdot \frac{20}{19} + 2y = 10 \implies \frac{100}{19} + 2y = 10 \implies 2y = 10 - \frac{100}{19} = \frac{90}{19} \implies y = \frac{45}{19}. \] So the intersection point is \( C = \left( \dfrac{20}{19}, \dfrac{45}{19} \right) \). Reason: The maximum of a linear objective function over a convex polygon must occur at one of its vertices, so we need all corner coordinates.
  5. Step 5: Evaluate Z at Each Corner Point: Now compute \( Z = 5x + 3y \) at every corner. At \( O = (0, 0) \): \[ Z = 5(0) + 3(0) = 0. \] At \( A = (2, 0) \): \[ Z = 5(2) + 3(0) = 10. \] At \( B = (0, 3) \): \[ Z = 5(0) + 3(3) = 9. \] At \( C = \left( \dfrac{20}{19}, \dfrac{45}{19} \right) \): \[ Z = 5 \cdot \frac{20}{19} + 3 \cdot \frac{45}{19} = \frac{100}{19} + \frac{135}{19} = \frac{235}{19} \approx 12.37. \] Reason: Comparing the values of \( Z \) at all corners directly reveals which point gives the maximum.
  6. Step 6: Identify the Maximum: Comparing all values — \( 0, 10, 9, \dfrac{235}{19} \approx 12.37 \) — the largest is \( \dfrac{235}{19} \), achieved at the interior intersection point \( C = \left( \dfrac{20}{19}, \dfrac{45}{19} \right) \). Reason: By the Corner Point Theorem, this is guaranteed to be the global maximum of \( Z \) over the entire feasible region.

Final Answer

The maximum value of \( Z \) is \( \dfrac{235}{19} \approx 12.37 \), attained at the point \( \left( \dfrac{20}{19}, \dfrac{45}{19} \right) \).

Common Mistake

One common mistake: students often check only axis intercept corners (like \( (2,0) \) and \( (0,3) \)) and forget to find and test the intersection point of the two constraint lines, which is frequently where the true maximum or minimum lies.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Corner points of feasible region: \( O(0,0) \), \( A(2,0) \), \( B\!\left(\dfrac{20}{19},\dfrac{45}{19}\right) \), \( C(0,3) \). Intersection \( B \) found by solving \( 3x+5y=15 \) and \( 5x+2y=10 \) simultaneously: multiply first by 2 and second by 5, giving \( 6x+10y=30 \) and \( 25x+10y=50 \), so \( 19x=20 \), i.e. \( x=\dfrac{20}{19} \), \( y=\dfrac{45}{19} \).
  2. Step 2: Evaluate \( Z=5x+3y \) at each corner: \( Z(O)=0 \), \( Z(A)=10 \), \( Z(C)=9 \), \( Z(B)=5\cdot\dfrac{20}{19}+3\cdot\dfrac{45}{19}=\dfrac{100+135}{19}=\dfrac{235}{19}\approx 12.37 \).

Answer: The maximum value of \( Z \) is \( \dfrac{235}{19} \approx 12.37 \), attained at the point \( \left( \dfrac{20}{19}, \dfrac{45}{19} \right) \).

➕ More Examples

More Examples

Example 1

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

Solution: We need to maximise \( Z = 4x + 5y \) subject to the given constraints. Constraint 1: \( 2x + y \le 8 \) The boundary line is \( 2x + y = 8 \). Setting \( x = 0 \) gives \( y = 8 \), and setting \( y = 0 \) gives \( x = 4 \). So the line passes through \( (0, 8) \) and \( (4, 0) \). Constraint 2: \( x + 2y \le 10 \) The boundary line is \( x + 2y = 10 \). Setting \( x = 0 \) gives \( y = 5 \), and setting \( y = 0 \) gives \( x = 10 \). So the line passes through \( (0, 5) \) and \( (10, 0) \). The feasible region is bounded by these lines and the axes in the first quadrant. Corner Points of the feasible region: Point A: Intersection of the y-axis and \( x + 2y = 10 \) gives \( (0, 5) \). Point B: Intersection of \( 2x + y = 8 \) and \( x + 2y = 10 \). From the first equation: \( y = 8 - 2x \). Substituting into the second: \[ x + 2(8 - 2x) = 10 \] \[ x + 16 - 4x = 10 \] \[ -3x = -6 \] \[ x = 2 \] Then \( y = 8 - 2(2) = 4 \). So Point B is \( (2, 4) \). Point C: Intersection of \( 2x + y = 8 \) and the x-axis gives \( (4, 0) \). Point O: Origin \( (0, 0) \). Now evaluate \( Z = 4x + 5y \) at each corner point: At \( O(0, 0) \): \[ Z = 4(0) + 5(0) = 0 \] At \( A(0, 5) \): \[ Z = 4(0) + 5(5) = 25 \] At \( B(2, 4) \): \[ Z = 4(2) + 5(4) = 8 + 20 = 28 \] At \( C(4, 0) \): \[ Z = 4(4) + 5(0) = 16 \] The maximum value of Z is 28, occurring at the point \( (2, 4) \).

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

Example 2

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

Solution: We need to maximise \( Z = 6x + 4y \) subject to the given constraints. Constraint 1: \( x + y \le 6 \) The boundary line is \( x + y = 6 \). It passes through \( (0, 6) \) and \( (6, 0) \). Constraint 2: \( 2x + y \le 10 \) The boundary line is \( 2x + y = 10 \). It passes through \( (0, 10) \) and \( (5, 0) \). The feasible region is the area in the first quadrant satisfying both constraints. Corner Points of the feasible region: Point O: Origin \( (0, 0) \). Point A: Intersection of the y-axis and \( x + y = 6 \) gives \( (0, 6) \). Point B: Intersection of \( x + y = 6 \) and \( 2x + y = 10 \). Subtracting the first equation from the second: \[ (2x + y) - (x + y) = 10 - 6 \] \[ x = 4 \] Substituting back: \( 4 + y = 6 \), so \( y = 2 \). Point B is \( (4, 2) \). Point C: Intersection of \( 2x + y = 10 \) and the x-axis gives \( (5, 0) \). Now evaluate \( Z = 6x + 4y \) at each corner point: At \( O(0, 0) \): \[ Z = 6(0) + 4(0) = 0 \] At \( A(0, 6) \): \[ Z = 6(0) + 4(6) = 24 \] At \( B(4, 2) \): \[ Z = 6(4) + 4(2) = 24 + 8 = 32 \] At \( C(5, 0) \): \[ Z = 6(5) + 4(0) = 30 \] The maximum value of Z is 32, occurring at the point \( (4, 2) \).

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

🎯 Try a Similar Question

Try a Similar Question

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

Solution

  1. Step 1: Identify and graph each constraint: Write the boundary lines of the constraints: Line 1: \( 2x + y = 8 \). When \( x = 0 \), \( y = 8 \); when \( y = 0 \), \( x = 4 \). So the intercepts are \( (0, 8) \) and \( (4, 0) \). Line 2: \( x + 2y = 10 \). When \( x = 0 \), \( y = 5 \); when \( y = 0 \), \( x = 10 \). So the intercepts are \( (0, 5) \) and \( (10, 0) \). Also, \( x \ge 0 \) and \( y \ge 0 \) restrict the region to the first quadrant.
  2. Step 2: Determine the feasible region: The feasible region satisfies all four constraints simultaneously: \[ 2x + y \le 8, \quad x + 2y \le 10, \quad x \ge 0, \quad y \ge 0 \] This is a bounded polygonal region in the first quadrant.
  3. Step 3: Find the corner points of the feasible region: The corner points are intersections of the boundary lines with each other and with the axes. Corner A: Intersection of \( x = 0 \) and \( y = 0 \) gives \( (0, 0) \). Corner B: Intersection of \( 2x + y = 8 \) and \( y = 0 \) gives \( (4, 0) \). Corner C: Intersection of \( 2x + y = 8 \) and \( x + 2y = 10 \). Solving: from the first equation, \( y = 8 - 2x \). Substituting into the second: \( x + 2(8 - 2x) = 10 \), so \( x + 16 - 4x = 10 \), giving \( -3x = -6 \), thus \( x = 2 \) and \( y = 8 - 2(2) = 4 \). Corner C is \( (2, 4) \). Corner D: Intersection of \( x + 2y = 10 \) and \( x = 0 \) gives \( y = 5 \), so \( (0, 5) \).
  4. Step 4: Evaluate the objective function at each corner point: Compute \( Z = 4x + 5y \) at each corner: At \( (0, 0) \): \( Z = 4(0) + 5(0) = 0 \) At \( (4, 0) \): \( Z = 4(4) + 5(0) = 16 \) At \( (2, 4) \): \( Z = 4(2) + 5(4) = 8 + 20 = 28 \) At \( (0, 5) \): \( Z = 4(0) + 5(5) = 25 \)
  5. Step 5: Identify the maximum value: Comparing the values: \[ Z(0,0) = 0, \quad Z(4,0) = 16, \quad Z(2,4) = 28, \quad Z(0,5) = 25 \] The maximum value is \( Z = 28 \), attained at the corner point \( (2, 4) \).

Answer: The maximum value of \( Z \) is \( 28 \), attained at the point \( (2,\ 4) \).

Everything you get with Solver7

More questions in Linear Programming