CONSTRAINTS - Essay Example

The values of ‘x’ will be the decision variables for which we have to find the optimum values. In every situation, there are certain limitations and restrictions that affect the variable values There can be less severe limitations and such constraints are considered “non-binding” constraints as they may not affect the ultimate solution for finding optimal values. A “binding constraint” is the one that changes optimal solution also, if there is a change in value of such constraint. Solution Space Also known as feasible region, it is the area that satisfies all non-negative restrictions and other constraints of the LPP.

Usually this is a convex type set and the optimum vale is found at its vertex Basic Solution Suppose there are ‘x’ constraints and ‘y’ decision variables in a LPP, and the solution of ‘x’ basic variables setting each of (y-x) non basic variable equals to Zero, then such solution will be known as basic solution. Therefore, a basic solution that satisfies the non-negativity constraint is called a basic feasible solution. Degenerate and Non-degenerate Solution.If one or more bsic variables are zero, then the solution is “degenerate”.

However if all the basic values are non-zero, then the solution is