LPP | Lec 3 | unique & multiple Optimal, Degenerate, Unbounded & Infeasible Solution.

In this video we have discussed Optimal Feasible Solution of LPP, unique & multiple Optimal, Degenerate, Unbounded & Infeasible Solution.
An optimal solution is a feasible solution where the objective function reaches its maximum (or minimum) value – for example, the most profit or the least cost.
A feasible solution is a set of values for the decision variables that satisfies all of the constraints in an optimization problem
An unbounded solution of a linear programming problem is a situation where objective function is infinite. A linear programming problem is said to have unbounded solution if its solution can be made infinitely large without violating any of its constraints in the problem.
The concept of multiple optimal solutions is associated with the linear programming problems. The multiple optimal solutions will arise in a linear program with more than one set of basic solutions that can minimize or maximize the required objective function.
If there is no feasible area (there is no any point that satisfy all constraints of the problem), then this solution is called infeasible solution.
Degeneracy in a linear programming problem is said to occur when a basic feasible solution contains a smaller number of non-zero variables than the number of independent constraints when values of some basic variables are zero and the Replacement ratio is same.

If this video seems to be helpful to you than subscribe to our channel for more updates and Share it to your friends.

For full playlist of Queuing Theory click below at:

For full playlist of Operation Research click below at:

#linearprogrammingproblem#operationresearch#mechproclasses