Transcription of Duality in Linear Programming 4
{{id}} {{{paragraph}}}
Example: confidence
Duality in Linear Programming 4
Duality in Linear Programming4In the preceding chapter on sensitivity analysis, we saw that the shadow-price interpretation of the optimalsimplex multipliers is a very useful concept. First, these shadow prices give us directly the marginal worthof an additional unit of any of the resources. Second, when an activity is priced out using these shadowprices, the opportunity cost of allocating resources to that activity relative to other activities is in Linear Programming is essentially a unifying theory that develops the relationships between agiven Linear program and another related Linear program stated in terms of variables with this shadow-priceinterpretation.
132 Duality in Linear Programming 4.1 The situation is much the same for the nonbasic variables x2,x4, and x5, with corresponding reduced costs: c2 =14 −11(2)−1 2 (2) =−9, c4 =0 −11(1)−1 2 (0) =−11, c5 =0 −11(0)−1 2 (1) =−1 2. The reduced costs for all nonbasic variables are negative. The interpretation is that, for the values ...
Tags:
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: