Example: bankruptcy
Duality in Linear Programming 4

Duality in Linear Programming 4

Back to document page

However, these shadow prices for the constraints of (2) are exactly the optimal values of the decision variables of the firm’s allocation problem. Hence, in solving the dual (2) by the simplex method, we apparently have solved the primal (1) as well. As we will see later, this will always be the case since ‘‘the

  Allocation, Optimal

Download Duality in Linear Programming 4


Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Advertisement

Related search queries