The set of values of decision variables that satisfy the linear constraints and non-negative condition of a linear programming problem is called is : |
Unbounded solution Bounded solution Feasible solution Optimum solution |
Feasible solution |
$\text{In linear programming,}$ $\text{the set of values of decision variables that satisfy all linear constraints}$ $\text{and the non-negativity conditions is called a feasible solution.}$ $\text{Correct option: Feasible solution}.$ |