SOLVER7 Study. Nothing Else.
2023 Board Paper Q30

Determine graphically the minimum value of the following objective function :
\(\begin{aligned} z = 500x + 400y\\ \text{subject to the constraints}\\ x + y \le 200,\\ x\ge20,\\ y\ge4x,\\ y\ge0.\end{aligned}\)

CBSE Class 12 Maths · Linear Programming

Solution

👶 Simple Explanation

Simple Explanation

Imagine you are shopping and want to spend as little money as possible. You have a few rules you must follow, like buying at least a certain amount of each item. The corner point method is like checking every corner of a map to find the cheapest spot. Here, we check every corner of the allowed region and calculate the cost \( z = 500x + 400y \) at each one. The smallest cost we find is our answer.

Answer: The minimum value is \( z = 42000 \), attained at the point \( (x, y) = (20, 80) \).

📖 Minimum Value of z = 500x + 400y by Graphical LPP Method

Detailed Explanation

In Linear Programming, we optimise (maximise or minimise) a linear objective function subject to linear constraints. The set of all points satisfying every constraint is called the feasible region. A fundamental theorem of LPP states that the optimal value of the objective function, if it exists, always occurs at a corner point (vertex) of the feasible region. So our strategy is: draw all the constraint lines, shade the region that satisfies all inequalities, identify the corner points, evaluate the objective function \( z \) at each corner, and pick the smallest value for the minimum.

Formula Used

Objective function: \( z = 500x + 400y \). Corner Point Method: evaluate \( z \) at every vertex of the feasible region; the least value gives the minimum.

Solution

  1. Step 1: Write down the constraints clearly. We must minimise \( z = 500x + 400y \) subject to \( x + y \le 200 \), \( x \ge 20 \), \( y \ge 4x \) and \( y \ge 0 \). Note that since \( y \ge 4x \) and \( x \ge 20 \), automatically \( y \ge 80 > 0 \), so \( y \ge 0 \) is not the binding condition here.
  2. Step 2: Convert each inequality into its boundary line to plot them. \( x + y = 200 \) is a line through \( (200, 0) \) and \( (0, 200) \). \( x = 20 \) is a vertical line. \( y = 4x \) is a line through the origin with slope \( 4 \), for example passing through \( (20, 80) \) and \( (40, 160) \).
  3. Step 3: Decide which side of each line is feasible. For \( x + y \le 200 \), test the origin \( (0,0) \): \( 0 \le 200 \) is true, so keep the side towards the origin. For \( x \ge 20 \), keep the region to the right of the vertical line. For \( y \ge 4x \), test a point like \( (0, 100) \): \( 100 \ge 0 \) is true, so keep the region above the line \( y = 4x \).
  4. Step 4: Find the corner points by solving the boundary lines pairwise. Intersection of \( x = 20 \) and \( y = 4x \): substituting gives \( y = 80 \), so point \( A(20, 80) \). Intersection of \( x = 20 \) and \( x + y = 200 \): gives \( y = 180 \), so point \( B(20, 180) \).
  5. Step 5: Find the third corner where \( y = 4x \) meets \( x + y = 200 \). Substitute \( y = 4x \) into \( x + y = 200 \): \[ x + 4x = 200 \] \[ 5x = 200 \] \[ x = 40, \quad y = 160 \] This gives point \( C(40, 160) \). The feasible region is the triangle with vertices \( A(20,80) \), \( B(20,180) \) and \( C(40,160) \).
  6. Step 6: Evaluate \( z = 500x + 400y \) at each corner point. At \( A(20, 80) \): \[ z = 500(20) + 400(80) = 10000 + 32000 = 42000 \] At \( B(20, 180) \): \[ z = 500(20) + 400(180) = 10000 + 72000 = 82000 \] At \( C(40, 160) \): \[ z = 500(40) + 400(160) = 20000 + 64000 = 84000 \]
  7. Step 7: Compare the values: \( 42000 \), \( 82000 \) and \( 84000 \). The smallest value is \( 42000 \), which occurs at the corner point \( A(20, 80) \). Since the feasible region is bounded (a triangle), this is indeed the minimum value.

Final Answer

The minimum value is \( z = 42000 \), attained at the point \( (x, y) = (20, 80) \).

Common Mistake

A common mistake is to test the wrong side for the constraint \( y \ge 4x \), shading below the line instead of above it, which produces an incorrect feasible region and wrong corner points. Always substitute a test point (not lying on the line) into the inequality to confirm the correct side before finding vertices.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Write down all the constraints. We need to minimise \( z = 500x + 400y \) subject to: \( x + y \le 200 \), \( x \ge 20 \), \( y \ge 4x \), and \( y \ge 0 \). — Reason: Listing the constraints clearly ensures we do not miss any boundary line when drawing the feasible region. Also note that since \( x \ge 20 \) and \( y \ge 4x \), we automatically get \( y \ge 80 \), so \( y \ge 0 \) is never the active (binding) restriction here.
  2. Step 2: Convert each inequality to its boundary line for graphing. The three relevant boundary lines are: \( x + y = 200 \) (passes through \( (200,\,0) \) and \( (0,\,200) \)), \( x = 20 \) (vertical line), and \( y = 4x \) (line through the origin with slope \( 4 \), passing through \( (20,\,80) \) and \( (40,\,160) \)). — Reason: Drawing boundary lines lets us identify the edges of the feasible region accurately.
  3. Step 3: Determine which side of each boundary line satisfies the inequality. For \( x + y \le 200 \): test the origin — \( 0 + 0 = 0 \le 200 \) is true, so the region below (and on) the line is feasible. For \( x \ge 20 \): the region to the right of (and on) \( x = 20 \) is feasible. For \( y \ge 4x \): test a point like \( (10, 50) \) — \( 50 \ge 40 \) is true, so the region above (and on) \( y = 4x \) is feasible. — Reason: Identifying the correct half-plane for each constraint lets us shade the feasible region properly.
  4. Step 4: Find all corner points of the feasible region by solving pairs of boundary lines simultaneously. Intersection of \( x = 20 \) and \( y = 4x \): substituting gives \( y = 4(20) = 80 \), so the corner is \( (20,\,80) \). Intersection of \( x = 20 \) and \( x + y = 200 \): substituting gives \( 20 + y = 200 \), so \( y = 180 \), giving the corner \( (20,\,180) \). Intersection of \( y = 4x \) and \( x + y = 200 \): substituting \( y = 4x \) gives \( x + 4x = 200 \), so \( 5x = 200 \), thus \( x = 40 \) and \( y = 160 \), giving the corner \( (40,\,160) \). — Reason: The optimal value of a linear objective function must occur at a corner point, so we must find them all.
  5. Step 5: Verify that each corner point satisfies all constraints before using it. For \( (20,\,80) \): \( 20 + 80 = 100 \le 200 \) ✓, \( 20 \ge 20 \) ✓, \( 80 \ge 4(20) = 80 \) ✓. For \( (20,\,180) \): \( 20 + 180 = 200 \le 200 \) ✓, \( 20 \ge 20 \) ✓, \( 180 \ge 4(20) = 80 \) ✓. For \( (40,\,160) \): \( 40 + 160 = 200 \le 200 \) ✓, \( 40 \ge 20 \) ✓, \( 160 \ge 4(40) = 160 \) ✓. — Reason: A point that violates even one constraint is outside the feasible region and cannot be a valid corner point.
  6. Step 6: Evaluate the objective function \( z = 500x + 400y \) at each corner point. At \( (20,\,80) \): \( z = 500(20) + 400(80) = 10000 + 32000 = 42000 \). At \( (40,\,160) \): \( z = 500(40) + 400(160) = 20000 + 64000 = 84000 \). At \( (20,\,180) \): \( z = 500(20) + 400(180) = 10000 + 72000 = 82000 \). — Reason: We compare the values of \( z \) at all corners to find the minimum.
  7. Step 7: Compare all computed values: \( z = 42000 \) at \( (20,\,80) \), \( z = 82000 \) at \( (20,\,180) \), and \( z = 84000 \) at \( (40,\,160) \). The smallest value is \( 42000 \), occurring at \( (20,\,80) \). — Reason: The corner point that gives the least value of \( z \) is the solution to the minimisation problem.

Final Answer

The minimum value is \( z = 42000 \), attained at the point \( (x, y) = (20, 80) \).

Common Mistake

One common mistake: students forget to check whether a candidate corner point actually satisfies all the constraints (not just the two lines used to compute it). A point that violates even one inequality is outside the feasible region and must be discarded, even if it gives a very small value of \( z \).

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Find corner points of feasible region: Intersection of \( x = 20 \) and \( y = 4x \): point \( (20, 80) \). Intersection of \( y = 4x \) and \( x + y = 200 \): \( x + 4x = 200 \Rightarrow x = 40,\, y = 160 \), giving point \( (40, 160) \).
  2. Step 2: Evaluate \( z \) at each corner point: At \( (20, 80) \): \( z = 500(20) + 400(80) = 10000 + 32000 = 42000 \). At \( (40, 160) \): \( z = 500(40) + 400(160) = 20000 + 64000 = 84000 \).
  3. Step 3: Identify minimum: Minimum value is \( z = 42000 \) at \( (20, 80) \).

Answer: The minimum value is \( z = 42000 \), attained at the point \( (x, y) = (20, 80) \).

➕ More Examples

More Examples

Example 1

Question: Determine graphically the minimum value of the objective function \[ Z = 300x + 600y \] subject to the constraints: \[ x + y \le 300 \] \[ x \ge 30 \] \[ y \ge 3x \] \[ y \ge 0 \]

Solution: Step 1: Identify and graph the constraints. Constraint 1: \( x + y \le 300 \) — region on or below the line \( x + y = 300 \). Constraint 2: \( x \ge 30 \) — region to the right of the vertical line \( x = 30 \). Constraint 3: \( y \ge 3x \) — region on or above the line \( y = 3x \). Constraint 4: \( y \ge 0 \) — region on or above the x-axis. Step 2: Find the corner points of the feasible region. Intersection of \( x = 30 \) and \( y = 3x \): \[ y = 3(30) = 90 \] So point \( A = (30,\, 90) \). Intersection of \( y = 3x \) and \( x + y = 300 \): Substituting \( y = 3x \) into \( x + y = 300 \): \[ x + 3x = 300 \Rightarrow 4x = 300 \Rightarrow x = 75 \] \[ y = 3(75) = 225 \] So point \( B = (75,\, 225) \). Intersection of \( x = 30 \) and \( x + y = 300 \): \[ 30 + y = 300 \Rightarrow y = 270 \] So point \( C = (30,\, 270) \). Step 3: Check feasibility of all corner points against every constraint. Point \( A = (30, 90) \): \( x + y = 120 \le 300 \) ✓, \( x = 30 \ge 30 \) ✓, \( y = 90 \ge 3(30) = 90 \) ✓. Point \( B = (75, 225) \): \( x + y = 300 \le 300 \) ✓, \( x = 75 \ge 30 \) ✓, \( y = 225 \ge 3(75) = 225 \) ✓. Point \( C = (30, 270) \): \( x + y = 300 \le 300 \) ✓, \( x = 30 \ge 30 \) ✓, \( y = 270 \ge 3(30) = 90 \) ✓. Step 4: Evaluate \( Z = 300x + 600y \) at each corner point. At \( A = (30, 90) \): \[ Z = 300(30) + 600(90) = 9000 + 54000 = 63000 \] At \( B = (75, 225) \): \[ Z = 300(75) + 600(225) = 22500 + 135000 = 157500 \] At \( C = (30, 270) \): \[ Z = 300(30) + 600(270) = 9000 + 162000 = 171000 \] Step 5: Identify the minimum. The minimum value of \( Z \) is \( 63000 \), attained at \( A = (30, 90) \).

Answer: Minimum value of \( Z = 63000 \) at the point \( (30,\, 90) \).

Example 2

Question: Determine graphically the minimum value of the objective function \[ Z = 200x + 350y \] subject to the constraints: \[ x + y \le 400 \] \[ x \ge 50 \] \[ y \ge 2x \] \[ y \ge 0 \]

Solution: Step 1: Identify and graph the constraints. Constraint 1: \( x + y \le 400 \) — region on or below the line \( x + y = 400 \). Constraint 2: \( x \ge 50 \) — region to the right of the vertical line \( x = 50 \). Constraint 3: \( y \ge 2x \) — region on or above the line \( y = 2x \). Constraint 4: \( y \ge 0 \) — region on or above the x-axis. Step 2: Find the corner points of the feasible region. Intersection of \( x = 50 \) and \( y = 2x \): \[ y = 2(50) = 100 \] So point \( A = (50,\, 100) \). Intersection of \( y = 2x \) and \( x + y = 400 \): Substituting \( y = 2x \) into \( x + y = 400 \): \[ x + 2x = 400 \Rightarrow 3x = 400 \Rightarrow x = \frac{400}{3} \approx 133.33 \] \[ y = 2 \times \frac{400}{3} = \frac{800}{3} \approx 266.67 \] So point \( B = \left(\frac{400}{3},\, \frac{800}{3}\right) \). Intersection of \( x = 50 \) and \( x + y = 400 \): \[ 50 + y = 400 \Rightarrow y = 350 \] So point \( C = (50,\, 350) \). Step 3: Check feasibility of all corner points against every constraint. Point \( A = (50, 100) \): \( x + y = 150 \le 400 \) ✓, \( x = 50 \ge 50 \) ✓, \( y = 100 \ge 2(50) = 100 \) ✓. Point \( B = \left(\frac{400}{3}, \frac{800}{3}\right) \): \( x + y = 400 \le 400 \) ✓, \( x \approx 133.33 \ge 50 \) ✓, \( y = 2x \) ✓. Point \( C = (50, 350) \): \( x + y = 400 \le 400 \) ✓, \( x = 50 \ge 50 \) ✓, \( y = 350 \ge 2(50) = 100 \) ✓. Step 4: Evaluate \( Z = 200x + 350y \) at each corner point. At \( A = (50, 100) \): \[ Z = 200(50) + 350(100) = 10000 + 35000 = 45000 \] At \( B = \left(\dfrac{400}{3},\, \dfrac{800}{3}\right) \): \[ Z = 200 \times \frac{400}{3} + 350 \times \frac{800}{3} = \frac{80000}{3} + \frac{280000}{3} = \frac{360000}{3} = 120000 \] At \( C = (50, 350) \): \[ Z = 200(50) + 350(350) = 10000 + 122500 = 132500 \] Step 5: Identify the minimum. The minimum value of \( Z \) is \( 45000 \), attained at \( A = (50, 100) \).

Answer: Minimum value of \( Z = 45000 \) at the point \( (50,\, 100) \).

🎯 Try a Similar Question

Try a Similar Question

Question: Determine graphically the minimum value of the objective function \( z = 300x + 200y \) subject to the constraints: \( x + y \le 150 \), \( x \ge 10 \), \( y \ge 3x \), \( y \ge 0 \).

Solution

  1. Step 1: Identify and rewrite the constraints: The constraints are: 1. \( x + y \le 150 \) 2. \( x \ge 10 \) 3. \( y \ge 3x \) 4. \( y \ge 0 \) These four inequalities define the feasible region.
  2. Step 2: Find the boundary lines and key intersection points: Convert each inequality to an equation and find intersections. Line 1: \( x + y = 150 \) Line 2: \( x = 10 \) Line 3: \( y = 3x \) Intersection of Line 2 and Line 3: Substitute \( x = 10 \) into \( y = 3x \): \[ y = 3(10) = 30 \] So the point is \( (10,\, 30) \). Intersection of Line 3 and Line 1: Substitute \( y = 3x \) into \( x + y = 150 \): \[ x + 3x = 150 \] \[ 4x = 150 \] \[ x = 37.5,\quad y = 112.5 \] So the point is \( (37.5,\, 112.5) \). Intersection of Line 2 and Line 1: Substitute \( x = 10 \) into \( x + y = 150 \): \[ y = 140 \] So the point is \( (10,\, 140) \).
  3. Step 3: Determine the feasible region: The feasible region must satisfy all four constraints simultaneously: - \( x + y \le 150 \) means we are on or below the line \( x + y = 150 \). - \( x \ge 10 \) means we are to the right of \( x = 10 \). - \( y \ge 3x \) means we are above the line \( y = 3x \). - \( y \ge 0 \) is automatically satisfied since \( y \ge 3x \) and \( x \ge 10 > 0 \). The feasible region is a bounded triangular region with corner (vertex) points: \( A = (10,\, 30) \), \( B = (37.5,\, 112.5) \), and \( C = (10,\, 140) \).
  4. Step 4: Evaluate the objective function at each corner point: Objective function: \( z = 300x + 200y \) At \( A = (10,\, 30) \): \[ z = 300(10) + 200(30) = 3000 + 6000 = 9000 \] At \( B = (37.5,\, 112.5) \): \[ z = 300(37.5) + 200(112.5) = 11250 + 22500 = 33750 \] At \( C = (10,\, 140) \): \[ z = 300(10) + 200(140) = 3000 + 28000 = 31000 \]
  5. Step 5: Identify the minimum value: Comparing the values: - At \( A \): \( z = 9000 \) - At \( B \): \( z = 33750 \) - At \( C \): \( z = 31000 \) The minimum value is \( z = 9000 \), attained at the corner point \( A = (10,\, 30) \).

Answer: The minimum value of \( z = 300x + 200y \) is \( z = 9000 \), attained at the point \( (x, y) = (10, 30) \).

Everything you get with Solver7

More questions in Linear Programming