Skip to main content
SpringerLink
Log in

Subdifferentiability and the Duality Gap

  • Published:
Positivity Aims and scope Submit manuscript

Abstract

We point out a connection between sensitivity analysis and the fundamental theorem of linear programming by characterizing when a linear programming problem has no duality gap. The main result is that the value function is subdifferentiable at the primal constraint if and only if there exists an optimal dual solution and there is no duality gap. To illustrate the subtlety of the condition, we extend Kretschmer's gap example to construct (as the value function of a linear programming problem) a convex function which is subdifferentiable at a point but is not continuous there. We also apply the theorem to the continuum version of the assignment model.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Charnes, A., Cooper, W. W. and Kortanek, K. O.: Duality in semi-infinite programs and some works of Haar and Carathéodory, Management Science 9 (1963), 209-228.

    Google Scholar 

  2. Charnes, A., Cooper, W. W. and Kortanek, K. O.: Semi-infinite programs which have no duality gap, Management Science 12 (1965), 113-121.

    Google Scholar 

  3. Duffin, R. J. and Karlovitz, L. A.: An infinite linear program with a duality gap, Management Science 12 (1965), 122-134.

    Google Scholar 

  4. Gale, D.: A geometric duality theorem with economic applications, The Review of Economic Studies 34 (1967), 19-24.

    Google Scholar 

  5. Gretsky, N. E., Ostroy J. M. and Zame, W. R.: The nonatomic assignement model, Economic Theory 2 (1992), 103-127.

    Google Scholar 

  6. Gretsky, N. E., Ostroy J. M. and Zame, W. R.: perfect competition in the continuous assignement model, Journal of Economic Theory 88 (1999), 60-118.

    Google Scholar 

  7. Holmes, R. B.: Geometric Functional Analysis and its Applications, Graduate Texts in Mathematics, No. 24, Springer, Berlin and New York, 1975.

    Google Scholar 

  8. Kretschmer, K. S.: Programs in paired spaces, Canadian Journal of Mathematics 13 (1961), 221-238.

    Google Scholar 

  9. Phelps, R. R.: Convex Functions, Monotone Operators, and Differentiability, Lecture Notes in Mathematics, No. 1364, 2nd Edition, Springer, Berlin and New York, 1993.

    Google Scholar 

  10. Rockafellar, R. T.: Convex Analysis, Princeton Mathematical Series, No. 128, Princeton University Press, Princeton, NJ, 1970.

    Google Scholar 

  11. Rockafellar, R. T.: Conjugate Duality and Optimization, CBMS-NSF Regional Conference in Applied Mathematics, Vol. 16, SIAM, Philadelphia, PA, 1974.

    Google Scholar 

  12. Verona, A. and Verona, M. E.: Locally efficient monotone operators, Proc. Amer. Math. Soc. 109 (1990), 195-204.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of California, Riverside, CA, U.S.A.

    N. E. Gretsky

  2. Department of Economics, University of California, Los Angeles, CA, U.S.A.

    J. M. Ostroy & W. R. Zame

Authors
  1. N. E. Gretsky
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. M. Ostroy
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. W. R. Zame
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gretsky, N.E., Ostroy, J.M. & Zame, W.R. Subdifferentiability and the Duality Gap. Positivity 6, 261–274 (2002). https://doi.org/10.1023/A:1020249022047

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1020249022047

Search

Navigation