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