SOLVER7 Study. Nothing Else.
Chapter 12 Examples Q4

Determine graphically the minimum value of the objective function
\(\begin{align}\text Z=– 50x + 20y&...(1)\\ \text {subject to the constraints:}\\ 2x – y \ge – \ 5&....(2)\\ 3x + y \ge 3&....(3)\\ 2x – 3y \le12&...(4)\\ x \ge 0, y \ge 0&....(5) \end{align}\)

CBSE Class 12 Maths · Linear Programming

Solution

👶 Simple Explanation

Simple Explanation

Imagine you are trying to spend as little money as possible at a shop, but there are rules about what you must buy. Those rules create a special allowed region on a graph. Only the corner points of that region matter for finding the best answer. We check the value at each corner point. The smallest value wins, and here the winner is at the corner point \( (6, 0) \), giving a minimum of \( Z = -300 \).

Answer: The minimum value of the objective function is \( Z = -300 \), attained at the corner point \( (6,0) \).

📖 Minimum Value of a Linear Objective Function

Detailed Explanation

This is a Linear Programming Problem (LPP). We want to optimise (here minimise) a linear objective function \( Z = -50x + 20y \) over a region defined by linear inequalities called constraints. The set of all points satisfying every constraint is called the feasible region. A very important theorem in LPP states that if the objective function has an optimum value (maximum or minimum), it must occur at a corner point (vertex) of the feasible region. So instead of checking infinitely many points, we only evaluate \( Z \) at the corner points. A special situation arises when the feasible region is unbounded (it extends infinitely). In that case, a minimum found at a corner is guaranteed to be the true minimum only if the open half plane \( -50x + 20y < m \) has no point in common with the feasible region, where \( m \) is the smallest value obtained at the corners. The graph shows the feasible region bounded by the four lines, with the corner points marked as \( (0,5) \), \( (0,3) \), \( (1,0) \) and \( (6,0) \).

Formula Used

Corner Point Method: The optimum value of \( Z = ax + by \) over a feasible region occurs at a corner point. Evaluate \( Z \) at every corner and compare. For an unbounded region, \( m \) is the minimum only if \( ax + by < m \) has no common point with the feasible region.

Solution

  1. Step 1: List the constraints: We must satisfy all of the following at once: \( 2x - y \ge -5 \), \( 3x + y \ge 3 \), \( 2x - 3y \le 12 \), \( x \ge 0 \), \( y \ge 0 \). We convert each inequality into its boundary line by replacing the inequality sign with an equality to draw the lines.
  2. Step 2: Identify the boundary lines: The boundary lines are \( 2x - y = -5 \) (i.e. \( -2x + y = 5 \)), \( 3x + y = 3 \), \( 2x - 3y = 12 \), together with the axes \( x = 0 \) and \( y = 0 \). These are exactly the lines shown in the figure.
  3. Step 3: Find the corner points from the graph: Reading the feasible region in the figure, the corner points are \( (0,5) \), \( (0,3) \), \( (1,0) \) and \( (6,0) \). For example, \( 3x + y = 3 \) meets \( x = 0 \) at \( (0,3) \) and meets \( y = 0 \) at \( (1,0) \); the line \( -2x + y = 5 \) meets \( x = 0 \) at \( (0,5) \); and \( 2x - 3y = 12 \) meets \( y = 0 \) at \( (6,0) \).
  4. Step 4: Evaluate Z at each corner point: Substitute each corner into \( Z = -50x + 20y \). \[ Z(0,5) = -50(0) + 20(5) = 100 \] \[ Z(0,3) = -50(0) + 20(3) = 60 \] \[ Z(1,0) = -50(1) + 20(0) = -50 \] \[ Z(6,0) = -50(6) + 20(0) = -300 \]
  5. Step 5: Identify the smallest value: Comparing the values \( 100, 60, -50, -300 \), the smallest is \( -300 \) at the corner \( (6,0) \).
  6. Step 6: Check the unbounded region condition: Since the feasible region is unbounded, we must confirm that \( -300 \) is truly the minimum. We check whether the open half plane \( -50x + 20y < -300 \) has any point in common with the feasible region. Testing shows this half plane has no point in common with the feasible region, so no feasible point gives a value less than \( -300 \). Hence \( -300 \) is indeed the minimum value.

Final Answer

The minimum value of the objective function is \( Z = -300 \), attained at the corner point \( (6,0) \).

Common Mistake

A common mistake is to stop after finding the smallest corner value without checking the unbounded region condition. For an unbounded feasible region you must verify that \( -50x + 20y < -300 \) has no point in common with the region; only then can you conclude that \( -300 \) is the actual minimum.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Write down the objective function and all constraints clearly. We want to minimise \( Z = -50x + 20y \) subject to: \( 2x - y \ge -5 \), \( 3x + y \ge 3 \), \( 2x - 3y \le 12 \), \( x \ge 0 \), and \( y \ge 0 \). — Reason: Listing every constraint ensures we do not miss any boundary line when drawing the feasible region.
  2. Step 2: Convert each inequality to an equation and find two points on each boundary line to sketch it. For \( 2x - y = -5 \): points \( (0, 5) \) and \( (-2.5, 0) \). For \( 3x + y = 3 \): points \( (0, 3) \) and \( (1, 0) \). For \( 2x - 3y = 12 \): points \( (6, 0) \) and \( (0, -4) \). — Reason: Plotting the boundary lines allows us to identify the region that satisfies all constraints simultaneously.
  3. Step 3: Shade the side of each boundary line that satisfies the corresponding inequality, and identify the feasible region as the intersection of all shaded areas (including \( x \ge 0 \) and \( y \ge 0 \), i.e., the first quadrant). The feasible region turns out to be unbounded, extending to the right. — Reason: The feasible region is the set of all points satisfying every constraint at once; it is the only region where any solution can exist.
  4. Step 4: Find the corner points (vertices) of the feasible region by solving pairs of boundary equations simultaneously. Solving \( 2x - y = -5 \) and \( 3x + y = 3 \) gives \( (0, 5) \) (check: \( 2(0)-5=-5 \ge -5 \) ✓ and \( 3(0)+5=5 \ge 3 \) ✓). Solving \( 3x + y = 3 \) and \( y = 0 \) gives \( (1, 0) \). Solving \( 2x - 3y = 12 \) and \( y = 0 \) gives \( (6, 0) \). The corner point on the y-axis from \( 3x + y = 3 \) at \( x = 0 \) gives \( (0, 3) \). So the corner points are \( (0, 5) \), \( (0, 3) \), \( (1, 0) \), and \( (6, 0) \). — Reason: Corner points are found at intersections of boundary lines; these are the only candidates for the optimum value.
  5. Step 5: Evaluate \( Z = -50x + 20y \) at each corner point. At \( (0, 5) \): \( Z = -50(0) + 20(5) = 100 \). At \( (0, 3) \): \( Z = -50(0) + 20(3) = 60 \). At \( (1, 0) \): \( Z = -50(1) + 20(0) = -50 \). At \( (6, 0) \): \( Z = -50(6) + 20(0) = -300 \). — Reason: By the Corner Point Theorem, the minimum value of \( Z \) over the feasible region must appear among these computed values.
  6. Step 6: Compare all computed values: \( 100 \), \( 60 \), \( -50 \), \( -300 \). The smallest value is \( -300 \), attained at \( (6, 0) \). Since the feasible region is unbounded, we must verify this is a true minimum by checking whether the open half-plane \( -50x + 20y < -300 \) has any point in common with the feasible region. The line \( -50x + 20y = -300 \) simplifies to \( 5x - 2y = 30 \). Checking feasible-region points shows no point satisfies both \( -50x + 20y < -300 \) and all the constraints. — Reason: For an unbounded region, the corner-point minimum must be confirmed; if the open half-plane has no overlap with the feasible region, the minimum is valid.

Final Answer

The minimum value of the objective function is \( Z = -300 \), attained at the corner point \( (6,0) \).

Common Mistake

One common mistake: Students forget to verify the minimum for an unbounded feasible region — they assume the smallest Z-value at a corner is automatically the true minimum without checking whether the open half-plane \( Z < m \) overlaps with the feasible region, which can lead to an incorrect conclusion.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Corner Points of the Feasible Region: Corner points: \( (0, 5) \), \( (0, 3) \), \( (1, 0) \), \( (6, 0) \).
  2. Step 2: Evaluate Z at Each Corner: At \( (0,5) \): \( Z = -50(0) + 20(5) = 100 \). At \( (0,3) \): \( Z = -50(0) + 20(3) = 60 \). At \( (1,0) \): \( Z = -50(1) + 20(0) = -50 \). At \( (6,0) \): \( Z = -50(6) + 20(0) = -300 \).
  3. Step 3: Verify Minimum for Unbounded Region: Check: \( -50x + 20y < -300 \) has no common point with the feasible region, so \( Z = -300 \) is the true minimum.

Answer: The minimum value of the objective function is \( Z = -300 \), attained at the corner point \( (6,0) \).

➕ More Examples

More Examples

Example 1

Question: Determine graphically the minimum value of the objective function \[Z = -40x + 30y\] subject to the constraints: \[x + y \ge 4\] \[2x + y \ge 6\] \[x + 2y \le 14\] \[x \ge 0,\quad y \ge 0\]

Solution: We identify and graph the boundary lines of each constraint. Constraint 1: \(x + y = 4\). Intercepts: \((4, 0)\) and \((0, 4)\). Test \((0,0)\): \(0 + 0 = 0 \not\ge 4\), so the feasible side is away from the origin. Constraint 2: \(2x + y = 6\). Intercepts: \((3, 0)\) and \((0, 6)\). Test \((0,0)\): \(0 \not\ge 6\), so the feasible side is away from the origin. Constraint 3: \(x + 2y = 14\). Intercepts: \((14, 0)\) and \((0, 7)\). Test \((0,0)\): \(0 \le 14\), so the feasible side includes the origin. Now we find the corner points of the feasible region. Intersection of \(2x + y = 6\) and \(x \ge 0, y = 0\): Setting \(y = 0\) gives \(x = 3\). Check \(x + y \ge 4\): \(3 \ge 4\) is false, so \((3, 0)\) is not in the feasible region. Intersection of \(x + y = 4\) and \(x = 0\): \(y = 4\), giving point \((0, 4)\). Check constraint 2: \(0 + 4 = 4 \not\ge 6\). Not feasible. Intersection of \(2x + y = 6\) and \(x = 0\): \(y = 6\), giving \((0, 6)\). Check \(x + y \ge 4\): \(6 \ge 4\) ✓. Check \(x + 2y \le 14\): \(12 \le 14\) ✓. Feasible. Intersection of \(2x + y = 6\) and \(x + y = 4\): Subtract the second from the first: \(x = 2\), then \(y = 2\). Check \(x + 2y \le 14\): \(2 + 4 = 6 \le 14\) ✓. Corner point: \((2, 2)\). Intersection of \(x + y = 4\) and \(x + 2y = 14\): Subtract: \(-y = -10\), so \(y = 10\), \(x = -6\). Since \(x < 0\), this is not feasible. Intersection of \(2x + y = 6\) and \(x + 2y = 14\): Multiply the first by 2: \(4x + 2y = 12\). Subtract: \(3x = -2\), so \(x = -\frac{2}{3}\). Not feasible. Intersection of \(x + 2y = 14\) and \(x = 0\): \(y = 7\). Check both \(\ge\) constraints: \(0 + 7 = 7 \ge 4\) ✓ and \(0 + 7 = 7 \ge 6\) ✓. Corner point: \((0, 7)\). The feasible region is unbounded above-left. The identified corner points are \((2, 2)\), \((0, 6)\), and \((0, 7)\). Now evaluate \(Z = -40x + 30y\) at each corner point. At \((2, 2)\): \[Z = -40(2) + 30(2) = -80 + 60 = -20\] At \((0, 6)\): \[Z = -40(0) + 30(6) = 0 + 180 = 180\] At \((0, 7)\): \[Z = -40(0) + 30(7) = 0 + 210 = 210\] The smallest value is \(Z = -20\) at \((2, 2)\). Since the feasible region is unbounded and the coefficient of \(x\) in \(Z\) is negative, we check whether there exist points in the feasible region with \(Z < -20\), i.e., \(-40x + 30y < -20\). This simplifies to \(4x - 3y > 2\). Checking whether this half-plane has a common point with the feasible region: take \((3, 0)\): it satisfies \(4(3) - 3(0) = 12 > 2\), but \((3,0)\) must satisfy all constraints. Check \(2(3) + 0 = 6 \ge 6\) ✓, \(3 + 0 = 3 \not\ge 4\). Not feasible. Try \((5, 2)\): \(2(5)+2 = 12 \ge 6\) ✓, \(5+2 = 7 \ge 4\) ✓, \(5+4 = 9 \le 14\) ✓. Check \(4(5)-3(2) = 14 > 2\) ✓. So there exist feasible points with \(Z < -20\), meaning the objective function has no finite minimum over this unbounded region. Hence, the minimum value of \(Z\) does not exist (the objective function is unbounded below over the feasible region).

Answer: The minimum value of \(Z = -40x + 30y\) does not exist; the objective function is unbounded below over the feasible region.

Example 2

Question: Determine graphically the minimum value of the objective function \[Z = -30x + 10y\] subject to the constraints: \[x - y \ge -3\] \[x + 2y \ge 6\] \[x + y \le 10\] \[x \ge 0,\quad y \ge 0\]

Solution: We graph the boundary lines. Constraint 1: \(x - y = -3\), i.e., \(y = x + 3\). Intercepts: \((0, 3)\) and \((-3, 0)\) (outside first quadrant). Test \((0,0)\): \(0 - 0 = 0 \ge -3\) ✓, so the feasible side includes the origin. Constraint 2: \(x + 2y = 6\). Intercepts: \((6, 0)\) and \((0, 3)\). Test \((0,0)\): \(0 \not\ge 6\), feasible side is away from origin. Constraint 3: \(x + y = 10\). Intercepts: \((10, 0)\) and \((0, 10)\). Test \((0,0)\): \(0 \le 10\) ✓, feasible side includes origin. Now find the corner points of the feasible region (first quadrant). Intersection of \(x + 2y = 6\) and \(y = 0\): \(x = 6\). Check all: \(6 - 0 = 6 \ge -3\) ✓, \(6 + 0 = 6 \le 10\) ✓. Corner point: \((6, 0)\). Intersection of \(x + 2y = 6\) and \(x - y = -3\): From \(x = y - 3\), substitute: \((y-3) + 2y = 6\), so \(3y = 9\), \(y = 3\), \(x = 0\). Check \(x + y = 3 \le 10\) ✓ and \(x \ge 0\) ✓. Corner point: \((0, 3)\). Intersection of \(x - y = -3\) and \(x + y = 10\): Add: \(2x = 7\), \(x = 3.5\), \(y = 6.5\). Check \(x + 2y = 3.5 + 13 = 16.5 \ge 6\) ✓. Corner point: \((3.5, 6.5)\). Intersection of \(x + 2y = 6\) and \(x + y = 10\): Subtract: \(y = -4\). Not feasible. Intersection of \(x + y = 10\) and \(x = 0\): \(y = 10\). Check \(0 - 10 = -10 \ge -3\)? No. Not feasible. Intersection of \(x + y = 10\) and \(y = 0\): \(x = 10\). Check \(10 + 0 = 10 \ge 6\) ✓ and \(10 - 0 = 10 \ge -3\) ✓. Corner point: \((10, 0)\). The feasible region is bounded. Corner points are \((6, 0)\), \((10, 0)\), \((3.5, 6.5)\), and \((0, 3)\). Evaluate \(Z = -30x + 10y\) at each corner point. At \((6, 0)\): \[Z = -30(6) + 10(0) = -180\] At \((10, 0)\): \[Z = -30(10) + 10(0) = -300\] At \((3.5, 6.5)\): \[Z = -30(3.5) + 10(6.5) = -105 + 65 = -40\] At \((0, 3)\): \[Z = -30(0) + 10(3) = 0 + 30 = 30\] The minimum value is \(Z = -300\) at the corner point \((10, 0)\).

Answer: The minimum value of \(Z = -30x + 10y\) is \(-300\), attained at \((10, 0)\).

🎯 Try a Similar Question

Try a Similar Question

Question: Determine graphically the minimum value of the objective function \[ Z = -40x + 30y \] subject to the constraints: \[ x + y \ge 4 \] \[ 2x + y \ge 6 \] \[ x + 2y \le 14 \] \[ x \ge 0,\quad y \ge 0 \]

Solution

  1. Step 1: Convert each constraint to an equation and find intercepts: Constraint 1: \( x + y = 4 \) gives intercepts \( (4, 0) \) and \( (0, 4) \). \nConstraint 2: \( 2x + y = 6 \) gives intercepts \( (3, 0) \) and \( (0, 6) \). \nConstraint 3: \( x + 2y = 14 \) gives intercepts \( (14, 0) \) and \( (0, 7) \).
  2. Step 2: Identify the feasible region: The constraints \( x + y \ge 4 \) and \( 2x + y \ge 6 \) mean the region is above (or on) these lines. The constraint \( x + 2y \le 14 \) means the region is below (or on) this line. Together with \( x \ge 0 \) and \( y \ge 0 \), the feasible region is bounded.
  3. Step 3: Find the corner points of the feasible region: Corner points arise at intersections of boundary lines within the first quadrant. \nIntersection of \( 2x + y = 6 \) and \( y = 0 \): gives \( (3, 0) \). \nIntersection of \( x + y = 4 \) and \( x + 2y = 14 \): Subtracting the first from the second gives \( y = 10 \), then \( x = -6 \). This is outside the first quadrant, so it is not a valid corner. \nIntersection of \( 2x + y = 6 \) and \( x + 2y = 14 \): Multiply the first by 2: \( 4x + 2y = 12 \). Subtract the second: \( 3x = -2 \), giving \( x = -\frac{2}{3} \). This is outside the first quadrant. \nIntersection of \( 2x + y = 6 \) and \( x + y = 4 \): Subtracting gives \( x = 2 \), then \( y = 2 \). Corner point: \( (2, 2) \). \nIntersection of \( x + y = 4 \) and \( x = 0 \): gives \( (0, 4) \). \nIntersection of \( x + 2y = 14 \) and \( x = 0 \): gives \( (0, 7) \). \nIntersection of \( x + 2y = 14 \) and \( y = 0 \): gives \( (14, 0) \). \nCheck which points satisfy ALL constraints. Testing \( (3, 0) \): \( x + y = 3 \not\ge 4 \). Not feasible. \nThe valid corner points of the feasible region are: \( (0, 4) \), \( (0, 7) \), \( (14, 0) \), and \( (2, 2) \). \nVerify \( (2, 2) \): \( x + y = 4 \ge 4 \) ✓, \( 2(2)+2=6 \ge 6 \) ✓, \( 2+4=6 \le 14 \) ✓. \nVerify \( (0, 7) \): \( 0+7=7 \ge 4 \) ✓, \( 0+7=7 \ge 6 \) ✓, \( 0+14=14 \le 14 \) ✓. \nVerify \( (14, 0) \): \( 14 \ge 4 \) ✓, \( 28 \ge 6 \) ✓, \( 14 \le 14 \) ✓. \nVerify \( (0, 4) \): \( 4 \ge 4 \) ✓, \( 0+4=4 \not\ge 6 \). Not feasible. \nSo the corner points are \( (2, 2) \), \( (0, 7) \), and \( (14, 0) \).
  4. Step 4: Evaluate the objective function at each corner point: At \( (2, 2) \): \[ Z = -40(2) + 30(2) = -80 + 60 = -20 \] \nAt \( (0, 7) \): \[ Z = -40(0) + 30(7) = 0 + 210 = 210 \] \nAt \( (14, 0) \): \[ Z = -40(14) + 30(0) = -560 + 0 = -560 \]
  5. Step 5: Determine the minimum value: Comparing the values: \( -20 \), \( 210 \), and \( -560 \). The minimum value is \( -560 \), attained at the corner point \( (14, 0) \).

Answer: The minimum value of the objective function is \( Z = -560 \), attained at the corner point \( (14, 0) \).

Everything you get with Solver7

More questions in Linear Programming