Question

A point that satisfies all of a problem's constraints simultaneously is $a\left(n\right)$

• A. maximum profit point.
• B. corner point.
• C. intersection of the profit line and a constraint.
• D. intersection of two or more constraints.
• E. None of the above

Answer 1

Answer: (E)

None of the above

The set of all the points that satisfy all of the problem's constraints is called feasible region. The points which belong to this region are feasible points.

In the above figure, the shaded blue region is the feasible region. The points in this region are feasible points which satisfy all the constraints.