The dual programming problem can be solved with the same algebraic technique that was employed to obtain the primal solution. In this case, the dual problem is
Because there are only two constraints in this programming problem, the maximum number of nonzero-valued variables at any corner solution is two. One can proceed with the solution by setting three of the variables equal to zero and solving the constraint equations for the values of the remaining two. By comparing the value of the objective function at each feasible solution, the point at which the function is minimized can be determined. This is the dual solution. To illustrate the process, first set VA = VB = VC = 0, and solve for LX and LY:
(9.13) |
(4 X 0) + (1 |
X 0) |
- LX = |
: 12 |
Was this article helpful?
Don't Blame Us If You End Up Enjoying Your Retired Life Like None Of Your Other Retired Friends. Already Freaked-Out About Your Retirement? Not Having Any Idea As To How You Should Be Planning For It? Started To Doubt If Your Later Years Would Really Be As Golden As They Promised? Fret Not Right Guidance Is Just Around The Corner.
Post a comment