The set of values of decision variables that satisfy the linear constraints and non-negative conditions of a linear programming problem is called its:
Answer & explanation
Correct answer: option 3
The correct answer is Option (3) → Feasible solution
In a linear programming problem, any set of values of the decision variables that satisfies all the constraints and the non-negativity conditions is called a feasible solution. All such points together form the feasible region.
A feasible solution that also gives the maximum or minimum value of the objective function is called an optimum (optimal) solution; it is a special feasible solution, not the name for every one of them.
“Bounded” and “unbounded” describe the feasible region, not a single set of values.