The economic significance of the average shadow price for integer and mixed integer programming problems has been established by researchers (Kim and Cho 1988), (Crema 1995). In this paper we introduce the concept of the marginal unit shadow price to deal with the integer programs where the right hand side resource availability can only be varied in discrete steps. We show that for integer programs, a sufficient condition for the marginal unit shadow price to equal the average shadow price is that the Law of Diminishing Returns should hold. The polyhedral structures that will guarantee this equivalence have been explored. Identification of the problem classes for which the equivalence holds greatly simplifies the existing procedure for determining shadow price for such integer programs.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by Indian Institute of Management Ahmedabad, Research and Publication Department in its series IIMA Working Papers with number
2003-06-02.
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.: