In linear programming problems the shadow price of a constraint is the difference between the optimised value of the objective function and the value of the ojective function, evaluated at the optional basis, when the right hand side (RHS) of a constraint is increased by one unit. It may be shown, using the approach of Winston (1995, pp250- 255, 293-300) that the shadow prices corresponding to the constraints of a primal LP problem are equal to the optimal values of teh dual variables.
Download Info
To our knowledge, this item is not available for
download. To find whether it is available, there are three
options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page
whether it is in fact available.
3. Perform a search for a similarly titled item that would be
available.
Publisher Info
Paper provided by New South Wales - School of Economics in its series Papers with number
96/18.
Length: 19 pages Date of creation: 1996 Date of revision: Handle: RePEc:fth:nesowa:96/18
Contact details of provider: Postal: THE UNIVERSITY OF NEW SOUTH WALES, SCHOOL OF ECONOMICS, P.O.B. 1 KENSINGTON, NEW SOUTH WALES 2033 AUSTRALIA. Phone: (+61)-2-9385-3380 Fax: +61)-2- 9313- 6337 Email: Web page: http://www.economics.unsw.edu.au/ More information through EDIRC
For technical questions regarding this item, or to correct its listing, contact: (Thomas Krichel).
Find related papers by JEL classification: C60 - Mathematical and Quantitative Methods - - Mathematical Methods and Programming - - - General E30 - Macroeconomics and Monetary Economics - - Prices, Business Fluctuations, and Cycles - - - General (includes Measurement and Data)