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) \).