An optimal solution to a linear programming problem MUST lie A. somewere on the line between two corner points. B. somewhere outside of the feasible region. C. somewhere in the interior of the feasible region. D. at the intersection of at least two constraints.

D. at the intersection of at least two constraints.

Explanation:

Linear programming is an optimization technique which is fine for the purpose of getting the best solution such as maximizing profit or certain o 4th era quantities. It is fine by modelling real life problems into mathematical models that have linear relationships or constraints such as in the form of objective functions. In linear programming, an objective function defines the formula for quantity optimization and the goal from this is to determine variable values that maximize or minimize the objective function depending on the problem robbery solved.