SOLVER7 Study. Nothing Else.
Exercise 12.1 Q1

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

CBSE Class 12 Maths · Linear Programming

Solution

👶 Simple Explanation

Simple Explanation

Imagine you have a bag that can hold at most 4 fruits total. You can pick apples or oranges, but none of the counts can go below zero. Each apple gives you 3 coins and each orange gives you 4 coins. You want the most coins possible. Filling the bag with only oranges gives you the best reward. So picking 4 oranges and no apples earns you 16 coins. That is the highest you can go without breaking any rule.

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

📖 Maximise Z = 3x + 4y Graphically

Detailed Explanation

In Linear Programming, we want to optimise (maximise or minimise) an objective function subject to some linear inequalities called constraints. The set of all points satisfying every constraint is called the feasible region. 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 point (vertex) of the feasible region. So instead of checking infinitely many points, we only need to check the finite number of corner points. Here the objective function is \( Z = 3x + 4y \) and the constraints \( x + y \le 4, x \ge 0, y \ge 0 \) describe a bounded triangular region in the first quadrant.

Formula Used

Objective function: \( Z = 3x + 4y \). Corner Point Theorem: the maximum (or minimum) of \( Z \) over a bounded feasible region occurs at one of its corner points.

Solution

  1. Step 1: Write down all the constraints clearly. We must maximise \( Z = 3x + 4y \) subject to \( x + y \le 4 \), \( x \ge 0 \) and \( y \ge 0 \). The conditions \( x \ge 0 \) and \( y \ge 0 \) tell us the feasible region lies in the first quadrant.
  2. Step 2: Convert the main inequality into a line to draw it. Replace \( x + y \le 4 \) by the boundary line \( x + y = 4 \). Find two points on this line: when \( x = 0 \) we get \( y = 4 \), giving the point \( (0, 4) \), and when \( y = 0 \) we get \( x = 4 \), giving the point \( (4, 0) \). Join these two points to draw the line.
  3. Step 3: Decide which side of the line to shade. Test the origin \( (0, 0) \) in \( x + y \le 4 \). We get \( 0 + 0 = 0 \le 4 \), which is true. So the region containing the origin (below the line) is the required side. Combined with \( x \ge 0 \) and \( y \ge 0 \), the feasible region is the triangle with vertices \( O(0,0) \), \( A(4,0) \) and \( B(0,4) \).
  4. Step 4: List the corner points of the feasible region. The vertices are \( O(0, 0) \), \( A(4, 0) \) and \( B(0, 4) \). Since the region is bounded, the maximum of \( Z \) will occur at one of these corners.
  5. Step 5: Evaluate \( Z = 3x + 4y \) at each corner point. At \( O(0,0) \): \[ Z = 3(0) + 4(0) = 0 \] At \( A(4,0) \): \[ Z = 3(4) + 4(0) = 12 \] At \( B(0,4) \): \[ Z = 3(0) + 4(4) = 16 \]
  6. Step 6: Compare the values and pick the largest. The values of \( Z \) are \( 0 \), \( 12 \) and \( 16 \). The greatest value is \( 16 \), which occurs at the point \( B(0, 4) \).

Final Answer

The maximum value of \( Z \) is \( 16 \), attained at the corner point \( (0, 4) \), that is when \( x = 0 \) and \( y = 4 \).

Common Mistake

A common mistake is testing only interior points or randomly chosen points instead of the corner points, or shading the wrong side of the line. Always test the origin (or another simple point) in each inequality to identify the correct feasible region, and evaluate \( Z \) only at the vertices.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: State the problem clearly. We need to maximise \( Z = 3x + 4y \) subject to the constraints \( x + y \le 4 \), \( x \ge 0 \), and \( y \ge 0 \). — Reason: Identifying the objective function and all constraints upfront ensures we do not miss any boundary of the feasible region.
  2. Step 2: Convert the inequality into a boundary line. Replace \( x + y \le 4 \) with the equation \( x + y = 4 \). Find two intercept points: setting \( x = 0 \) gives \( y = 4 \), so one point is \( (0, 4) \); setting \( y = 0 \) gives \( x = 4 \), so another point is \( (4, 0) \). Plot and join these two points. — Reason: Drawing the boundary line is the first step to graphing the feasible region.
  3. Step 3: Determine which side of the line to shade. Test the origin \( (0, 0) \) in the inequality: \( 0 + 0 = 0 \le 4 \), which is true. Therefore, shade the side containing the origin, i.e., the region where \( x + y \le 4 \). — Reason: The test point tells us which half-plane satisfies the constraint; we keep that side as part of the feasible region.
  4. Step 4: Identify the feasible region and list all corner points. Combined with \( x \ge 0 \) and \( y \ge 0 \), the feasible region is a triangle in the first quadrant. Its three corner points are \( (0, 0) \), \( (4, 0) \), and \( (0, 4) \). — Reason: The corner points are the only candidates for the optimum according to the Corner Point Theorem.
  5. Step 5: Evaluate \( Z = 3x + 4y \) at each corner point. At \( (0, 0) \): \( Z = 3(0) + 4(0) = 0 \). At \( (4, 0) \): \( Z = 3(4) + 4(0) = 12 \). At \( (0, 4) \): \( Z = 3(0) + 4(4) = 16 \). — Reason: Substituting each vertex into the objective function lets us compare values directly to find the maximum.
  6. Step 6: Compare the values obtained: \( 0 \), \( 12 \), and \( 16 \). The largest value is \( 16 \), occurring at the corner point \( (0, 4) \). — Reason: The highest value among all corner-point evaluations is the maximum of \( Z \) over the entire feasible region, guaranteed by the Corner Point Theorem.

Final Answer

The maximum value of \( Z \) is \( 16 \), attained at the corner point \( (0, 4) \), that is when \( x = 0 \) and \( y = 4 \).

Common Mistake

One common mistake: students sometimes forget to include the origin \( (0, 0) \) as a corner point, or they shade the wrong side of the boundary line (they shade where the inequality is NOT satisfied), leading to an incorrect feasible region and a wrong optimal value.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Corner points of the feasible region (bounded by \( x + y = 4 \) in the first quadrant): \( (0, 0) \), \( (4, 0) \), \( (0, 4) \).
  2. Step 2: Evaluate \( Z = 3x + 4y \) at each corner: \( Z(0,0) = 0 \), \( Z(4,0) = 12 \), \( Z(0,4) = 16 \).
  3. Step 3: Maximum value is \( Z = 16 \) at \( (0, 4) \).

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

➕ More Examples

More Examples

Example 1

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

Solution: We need to maximise \( Z = 5x + 3y \) subject to \( 2x + y \le 6 \), \( x \ge 0 \), \( y \ge 0 \). Step 1: Find the boundary line of the constraint \( 2x + y = 6 \). When \( x = 0 \): \( y = 6 \), giving point \( (0, 6) \). When \( y = 0 \): \( x = 3 \), giving point \( (3, 0) \). Step 2: The feasible region is bounded by \( 2x + y \le 6 \), \( x \ge 0 \), \( y \ge 0 \). It is a triangle with vertices at \( (0, 0) \), \( (3, 0) \), and \( (0, 6) \). Step 3: Evaluate \( Z = 5x + 3y \) at each corner point. At \( (0, 0) \): \[ Z = 5(0) + 3(0) = 0 \] At \( (3, 0) \): \[ Z = 5(3) + 3(0) = 15 \] At \( (0, 6) \): \[ Z = 5(0) + 3(6) = 18 \] Step 4: The maximum value of \( Z \) is \( 18 \), attained at \( (0, 6) \).

Answer: Maximum \( Z = 18 \) at \( (0, 6) \).

Example 2

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

Solution: We need to maximise \( Z = 2x + 5y \) subject to \( x + 2y \le 8 \), \( x \ge 0 \), \( y \ge 0 \). Step 1: Find the boundary line of the constraint \( x + 2y = 8 \). When \( x = 0 \): \( 2y = 8 \), so \( y = 4 \), giving point \( (0, 4) \). When \( y = 0 \): \( x = 8 \), giving point \( (8, 0) \). Step 2: The feasible region is bounded by \( x + 2y \le 8 \), \( x \ge 0 \), \( y \ge 0 \). It is a triangle with vertices at \( (0, 0) \), \( (8, 0) \), and \( (0, 4) \). Step 3: Evaluate \( Z = 2x + 5y \) at each corner point. At \( (0, 0) \): \[ Z = 2(0) + 5(0) = 0 \] At \( (8, 0) \): \[ Z = 2(8) + 5(0) = 16 \] At \( (0, 4) \): \[ Z = 2(0) + 5(4) = 20 \] Step 4: The maximum value of \( Z \) is \( 20 \), attained at \( (0, 4) \).

Answer: Maximum \( Z = 20 \) at \( (0, 4) \).

🎯 Try a Similar Question

Try a Similar Question

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

Solution

  1. Step 1: Identify the Constraints and Objective Function: The objective function is \( Z = 5x + 3y \). The constraints are \( 2x + y \le 10 \), \( x + 3y \le 12 \), \( x \ge 0 \), \( y \ge 0 \). We need to find the feasible region and evaluate \( Z \) at each corner point.
  2. Step 2: Draw the Boundary Lines: Convert each inequality to an equation for graphing. Line 1: \( 2x + y = 10 \). When \( x = 0 \), \( y = 10 \), giving point \( (0, 10) \). When \( y = 0 \), \( x = 5 \), giving point \( (5, 0) \). Line 2: \( x + 3y = 12 \). When \( x = 0 \), \( y = 4 \), giving point \( (0, 4) \). When \( y = 0 \), \( x = 12 \), giving point \( (12, 0) \). Plot both lines on the coordinate plane.
  3. Step 3: Find the Intersection Point of the Two Lines: Solve the system \( 2x + y = 10 \) and \( x + 3y = 12 \) simultaneously. From the first equation: \( y = 10 - 2x \). Substituting into the second equation: \( x + 3(10 - 2x) = 12 \), which gives \( x + 30 - 6x = 12 \), so \( -5x = -18 \), hence \( x = \dfrac{18}{5} \). Then \( y = 10 - 2 \cdot \dfrac{18}{5} = 10 - \dfrac{36}{5} = \dfrac{14}{5} \). The intersection point is \( \left(\dfrac{18}{5},\ \dfrac{14}{5}\right) \).
  4. Step 4: Identify the Feasible Region and Corner Points: The feasible region is bounded by both constraints along with \( x \ge 0 \) and \( y \ge 0 \). The corner points of the feasible region are: \( A = (0, 0) \), \( B = (5, 0) \), \( C = \left(\dfrac{18}{5}, \dfrac{14}{5}\right) \), and \( D = (0, 4) \).
  5. Step 5: Evaluate the Objective Function at Each Corner Point: At \( A = (0, 0) \): \( Z = 5(0) + 3(0) = 0 \). At \( B = (5, 0) \): \( Z = 5(5) + 3(0) = 25 \). At \( C = \left(\dfrac{18}{5}, \dfrac{14}{5}\right) \): \( Z = 5 \cdot \dfrac{18}{5} + 3 \cdot \dfrac{14}{5} = 18 + \dfrac{42}{5} = \dfrac{90 + 42}{5} = \dfrac{132}{5} = 26.4 \). At \( D = (0, 4) \): \( Z = 5(0) + 3(4) = 12 \).
  6. Step 6: Determine the Maximum Value: Comparing the values: \( Z(A) = 0 \), \( Z(B) = 25 \), \( Z(C) = 26.4 \), \( Z(D) = 12 \). The maximum value of \( Z \) is \( \dfrac{132}{5} \) (i.e., \( 26.4 \)), attained at the corner point \( C = \left(\dfrac{18}{5}, \dfrac{14}{5}\right) \).

Answer: The maximum value of \( Z = 5x + 3y \) is \( \dfrac{132}{5} \) (i.e., \( 26.4 \)), attained at the corner point \( \left(\dfrac{18}{5},\ \dfrac{14}{5}\right) \), that is when \( x = \dfrac{18}{5} \) and \( y = \dfrac{14}{5} \).

Everything you get with Solver7

More questions in Linear Programming