Linear Programming
It is a mathematical technique for determining optimal allocation of resources.
• Objective Function: Clearly identifiable and measurable in quantity e.g. maximization of profit.
• Constraints: These are limited resources with in which we have to make the objective function maximum
z = c1x1 + c2x2 + …
a11 x1 + a12 x2 + … ≥ b1
Cj = profit coefficient
bi = resource value
aij = technological coefficient
xj = variable
Special Cases: Linear programming problems can be solved by– Graphical method
- Infinite Solution: Objective function slope equals to one of the constrain which forms the boundary.
- No Solution: It is not possible to find feasible solution which satisfy all the constrain.
- Unbounded Solution: The greatest value of objective function occurs at infinite and it simply means the common feasible region is not bounded by limit on constrain.
