Question

Define optimal (feasible) solution of a linear programming problem.

Answer 1

Any point in the feasible region of a linear programming problem that gives the optimal value (maximum or minimum) of the objective function is called an optimal (feasible) solution.

Observe the following figure:

In figure, the feasible region of a linear inequations is the region bounded by $OABC$.

So, every point in this region satisfies the given conditions in this region.

This is called an optimal solution.