Question

How do you find the optimal solution in linear programming $?$

Answer 1

Finding optimal solution:

An optimal solution is a feasible solution where the objective function reaches its maximum (or minimum) value, that means the maximum profit or the least cost.

The values of $x$ and $y$ are said to be optimal solutions for which the objective function $z=ax+by$ is minimum or maximum based on the given linear programming problem.

However, different methods exist to find the optimal solution of a LP problem such as graphical method, simplex method and so on.

Hence, in this way, we can find the optimal solution in linear programming.