Question:medium

If the constraints of a Linear Programming Problem are : \(x + y \leq 6, 2x + y \leq 8, x \geq 0, y \geq 0\), then a corner point of the feasible region is

Show Hint

To quickly find the valid intercepts, choose the smaller intercept on each axis. For x: \(\min(6, 4) = 4 \implies (4,0)\). For y: \(\min(6, 8) = 6 \implies (0,6)\). This saves time on checking constraints.
Updated On: Jun 24, 2026
  • (6,0)
  • (0,8)
  • (2,4)
  • (4,2)
Show Solution

The Correct Option is C

Solution and Explanation

Was this answer helpful?
0