In linear programming, solutions that satisfy all of the constraints simultaneously are referred to as:
A) optimal.
B) feasible.
C) nonnegative.
D) targeted.
E) All of the answer choices are correct.

Question

Quizplus · Accepted Answer

Feasible solutions are the ones that satisfy all the constraints in a linear programming problem. Optimal solutions are feasible solutions that also maximize or minimize the objective function, but not all feasible solutions are optimal. Nonnegative solutions refer to the requirement that all variables must be greater than or equal to zero, which is a special case of feasibility. "Targeted" is not a commonly used term in linear programming.

In Linear Programming, Solutions That Satisfy All of the Constraints