Zaymiey

📐 Mathematics  ·  Linear Programming  ·  JEE

With x ≥ 0 and y ≥ 0, the feasible region lies in the:

Answer: first quadrant.

  • A first quadrant
  • B second quadrant
  • C third quadrant
  • D fourth quadrant

Correct answer: A. first quadrant

Explanation: Both coordinates non-negative places the region in the first quadrant.

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 →