Skip to main content
Log in

Shadow prices in nonconvex mathematical programming

  • Published:
Mathematical Programming Submit manuscript

Abstract

In this paper a definition is proposed for the concept of shadow prices in nonconvex programming. For a nonlinear program with equality and inequality constraints, existence of these prices and bounds for their possible values are obtained under the Mangasarian—Fromowitz regularity condition. Their exact values and some continuity properties are obtained under the more restrictive linear independence regularity condition. A definition of equilibrium prices is also proposed. Under convexity assumptions, all definitions and results coincide with those already known on this subject in convex programming.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. M.L. Balinski and W.J. Baumol, “The dual in nonlinear programming and its economic interpretation”,The Review of Economic Studies 35 (1968) 237–257.

    Google Scholar 

  2. A.V. Fiacco and G.P. McCormick,Nonlinear programming: Sequential unconstrained minimization techniques (Wiley, New York, 1968).

    Google Scholar 

  3. J. Gauvin, “A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming”,Mathematical Programming 12 (1977) 136–138.

    Google Scholar 

  4. J. Gauvin, “The generalized gradient of a marginal function in mathematical programming”,Mathematics of Operations Research 4 (1979) 458–463.

    Google Scholar 

  5. J. Gauvin and J.W. Tolle, “Differential stability in nonlinear programming”,SIAM Journal on Control and Optimization 15 (1977) 294–311.

    Google Scholar 

  6. E.G. Gol'stein,Theory of convex programming, Translations of Mathematics Monographs, Vol. 36 (American Mathematical Society, Providence, RI, 1972).

    Google Scholar 

  7. F.J. Gould and S. Howe, “A new result on interpreting Lagrange multipliers as dual variables”, Technical report no. 738, The Institute of Statistics, University of North Carolina (Chapel Hill, NC, 1971).

    Google Scholar 

  8. G. Hadley,Nonlinear and dynamic programming (Addison-Wesley, Reading, MA, 1964).

    Google Scholar 

  9. L.V. Kantorovich, “Mathematics in economics: Achievement, difficulties, perspectives”,Mathematical Programming 11 (1976) 204–211.

    Google Scholar 

  10. T.C. Koopmans, “Concepts of optimality and their uses”,Mathematical Programming 11 (1976) 212–228.

    Google Scholar 

  11. D.G. Luenberger,Introduction to linear and nonlinear programming (Addison-Wesley, Reading, MA, 1973).

    Google Scholar 

  12. E.J. McShane and T.A. Botts,Real analysis (D. Van Nostrand, New York, 1959).

    Google Scholar 

  13. R.T. Rockafellar,Convex analysis (Princeton University Press, Princeton, NJ, 1970).

    Google Scholar 

  14. R.T. Rockafellar, “Greedy prices: A saddle point condition characterizing optimality in general nonlinear programming”, Lecture given at the IX international symposium on mathematical programming, Budapest, August 23–27 (1976).

  15. P.A. Samuelson,Foundations of economic analysis (Harvard University Press, 1948).

  16. A.C. Williams, “Nonlinear activity analysis and duality”, in: H.W. Kuhn, ed.,Proceedings of the Princeton symposium on mathematical programming (Princeton University Press, Princeton, NJ, 1970) pp. 163–177.

    Google Scholar 

  17. W.I. Zangwill,Nonlinear programming: A unified approach (Prentice Hall, Englewood Cliffs, NJ, 1969).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This research was supported by the Natural Sciences and Engineering Research Council of Canada under Grant A-9273.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gauvin, J. Shadow prices in nonconvex mathematical programming. Mathematical Programming 19, 300–312 (1980). https://doi.org/10.1007/BF01581650

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01581650

Key words

Navigation