Zaymiey

📐 Mathematics  ·  Linear Programming  ·  JEE

The point (2, 3) satisfies the constraint x + y ≤ 6 because:

Answer: 2 + 3 = 5, which is ≤ 6.

  • A 2 + 3 = 5, which is ≤ 6
  • B 2 + 3 equals exactly 6
  • C 2 × 3 equals 6
  • D it actually fails the test

Correct answer: A. 2 + 3 = 5, which is ≤ 6

Explanation: Since 2 + 3 = 5 and 5 ≤ 6, the point lies in the feasible region.

Feasible Region and Corner PointsxyOABCfeasible regionZ = ax+by is evaluated ONLY at corners O, A, B, C - the optimum is always at one of these

The feasible region (shaded) is bounded by the constraint lines; the fundamental theorem of LPP guarantees the optimal value of the objective function occurs at one of the corner points (O, A, B, C), so only these need to be checked, not the entire region.

Concept context

Optimizing a linear objective function subject to linear constraints using the graphical corner point method.

Read the full Linear Programming notes →