The area that contains the values that satisfies all the constraints in a linear programming problem is known as the _________________ space.
A)optimal solution
B)non-optimal solution
C)feasible solution
D)infeasible solution.

Question

Quizplus · Accepted Answer

The feasible space (or feasible region) is the area that contains all the values that satisfying all the constraints in a linear programming problem. The optimal solution is a point within the feasible space that maximizes or minimizes the objective function. A non-optimal solution is a feasible solution that is not the best possible solution. An infeasible solution is a solution that violates one or more of the constraints and is not part of the feasible space.

The Area That Contains the Values That Satisfies All the Constraints