An optimal solution to a linear programming problem must liea. somewhere in the interior of the feasible region. b. somewhere outside of the feasible region. c. at the intersection of at least two constraints. d. somewere on the line between two corner points.

C. at the intersection of at least two constraints.

Explanation:

Every linear equation has an objective function, further it has the constraints.

In a linear equation when we find the value of constraints where, the value of at least two constraints shall meet, in order to find the solution.

This provides a solution set as when they intersect there are chances of solution, and accordingly even the objective function is easily achieved.

Accordingly the best set which fulfills the objective function where the constraints are also matching the criteria, there lies a solution set.

d. automatic stabilizers.

explanation:

answer; manager working long hours; plz check i believe this is correct good luck;