Posted in Operations and Supply Chain Terms, Total Reads: 1156
The linear programming problem addresses resource allocation and also resource valuation. While the resource allocation is solved using the primal problem, the value of each resource is identified using the dual problem.
Every linear programming problem which has a primal problem can also be converted into a dual problem. The rules for converting a primal into a dual problem are as follows:
Decision variable: x
For any primal and dual problem all relationships between them must be symmetric.
Obj function: Max
If constraint is
If variable is
– If a constraint is inactive in an optimal solution of the primal problem then corresponding dual variable equal to zero .
– Or an inactive constraint in an dual problem will have its corresponding variable equal to zero in primal solution
If constraint is active then corresponding dual variable is unequal to zero. Conversely an active constraint of the dual problem will have its corresponding variable unequal to zero.