Example 1
Question: The feasible region of a linear programming problem has corner points at \( (0, 5) \), \( (2, 3) \), and \( (4, 0) \). The boundary lines are \( x + y = 5 \) and \( x + 2y = 8 \), and the region lies in the first quadrant. Which of the following represents the correct set of constraints? (A) \( x + y \le 5,\; x + 2y \le 8,\; x \ge 0,\; y \ge 0 \) (B) \( x + y \ge 5,\; x + 2y \ge 8,\; x \ge 0,\; y \ge 0 \) (C) \( x + y \le 5,\; x + 2y \ge 8,\; x \ge 0,\; y \ge 0 \) (D) \( x + y \ge 5,\; x + 2y \le 8,\; x \ge 0,\; y \ge 0 \)
Solution: We identify the boundary lines and check which side of each line the feasible region lies on. The two boundary lines are \( x + y = 5 \) and \( x + 2y = 8 \). The corner points of the feasible region are \( (0, 5) \), \( (2, 3) \), and \( (4, 0) \). This is a bounded triangular region in the first quadrant. Since the region is in the first quadrant, the non-negativity constraints are \( x \ge 0 \) and \( y \ge 0 \). Now test an interior point of the feasible region. The centroid of the triangle is approximately \[ \left(\frac{0+2+4}{3},\; \frac{5+3+0}{3}\right) = \left(2,\; \frac{8}{3}\right) \] Test the point \( \left(2, \frac{8}{3}\right) \) in the first constraint \( x + y \) vs 5: \[ 2 + \frac{8}{3} = \frac{6+8}{3} = \frac{14}{3} \approx 4.67 \] Since \( 4.67 < 5 \), the interior satisfies \( x + y \le 5 \). Test the same point in the second constraint \( x + 2y \) vs 8: \[ 2 + 2 \times \frac{8}{3} = 2 + \frac{16}{3} = \frac{6+16}{3} = \frac{22}{3} \approx 7.33 \] Since \( 7.33 < 8 \), the interior satisfies \( x + 2y \le 8 \). Both boundary lines form the upper boundary of the feasible region (the region is below both lines), so both inequalities use \( \le \). Therefore the constraints are \( x + y \le 5 \), \( x + 2y \le 8 \), \( x \ge 0 \), \( y \ge 0 \), which matches option (A).
Answer: Option (A): \( x + y \le 5,\; x + 2y \le 8,\; x \ge 0,\; y \ge 0 \)
Example 2
Question: The feasible region of a linear programming problem is an unbounded region in the first quadrant with corner points at \( (0, 6) \) and \( (3, 0) \). The boundary lines passing through these intercepts are \( 2x + y = 6 \) and \( x + 3y = 9 \), and the feasible region extends away from the origin. Which of the following represents the correct set of constraints? (A) \( 2x + y \le 6,\; x + 3y \le 9,\; x \ge 0,\; y \ge 0 \) (B) \( 2x + y \ge 6,\; x + 3y \le 9,\; x \ge 0,\; y \ge 0 \) (C) \( 2x + y \ge 6,\; x + 3y \ge 9,\; x \ge 0,\; y \ge 0 \) (D) \( 2x + y \le 6,\; x + 3y \ge 9,\; x \ge 0,\; y \ge 0 \)
Solution: We are told the feasible region is unbounded and lies away from the origin (i.e., on the far side of both boundary lines from the origin). The boundary lines are \( 2x + y = 6 \) and \( x + 3y = 9 \). The corner points are \( (0, 6) \) (on \( 2x + y = 6 \)) and \( (3, 0) \) (on \( 2x + y = 6 \)). Since the region extends away from the origin, test the origin \( (0, 0) \) to determine which side the feasible region is NOT on. Test \( (0,0) \) in \( 2x + y \): \[ 2(0) + 0 = 0 \] Since \( 0 < 6 \), the origin satisfies \( 2x + y < 6 \). The feasible region (away from origin) satisfies \( 2x + y \ge 6 \). Test \( (0,0) \) in \( x + 3y \): \[ 0 + 3(0) = 0 \] Since \( 0 < 9 \), the origin satisfies \( x + 3y < 9 \). The feasible region (away from origin) satisfies \( x + 3y \ge 9 \). Verify with a point clearly in the feasible region, say \( (5, 5) \): \[ 2(5) + 5 = 15 \ge 6 \quad \checkmark \] \[ 5 + 3(5) = 20 \ge 9 \quad \checkmark \] Since the region is in the first quadrant, the non-negativity constraints \( x \ge 0 \) and \( y \ge 0 \) apply. Therefore the constraints are \( 2x + y \ge 6 \), \( x + 3y \ge 9 \), \( x \ge 0 \), \( y \ge 0 \), which matches option (C).
Answer: Option (C): \( 2x + y \ge 6,\; x + 3y \ge 9,\; x \ge 0,\; y \ge 0 \)