Skip to main content

A Finite-Dimensional Approach to Infinite-Dimensional Constraints in Stochastic Programming Duality

  • Chapter
Stochastic Optimization: Algorithms and Applications

Part of the book series: Applied Optimization ((APOP,volume 54))

  • 1524 Accesses

Abstract

A new duality theory is developed for a class of two-stage stochastic programs in which the probability distribution is not necessarily discrete, providing a new framework for problems which do not necessarily have relatively complete recourse and do not satisfy the typical Slater conditions. The results instead rely on the much weaker constraint qualification of ‘calmness’ of certain finite-dimensional marginal functions to derive the existence of finite-dimensional Lagrange multipliers. In this way, strong duality results are established in which the dual problems are finite-dimensional, despite the possible infinite-dimensional character of the second-stage constraints. Numerical possibilities for this class of problems are highlighted.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F.H. Clarke (1976), A new approach to lagrange multipliers. Mathematics of Operations Research, 1 (2), 165–174.

    Article  MathSciNet  MATH  Google Scholar 

  2. M.J. Eisner and P. Olsen (1975), Duality for stochastic programming interpreted as L.P. in LP space. SIAM Journal of Applied Mathematics, 28 (4), 779–792.

    Google Scholar 

  3. R.T. Rockafellar. (1974), Conjugate Duality and Optimization. SIAM.

    Google Scholar 

  4. R.T. Rockafellar and R.J-B Wets (1976), Stochastic convex programming: basic duality. Pacific Journal of Mathematics, 62 (1), 173–195.

    Article  MathSciNet  MATH  Google Scholar 

  5. R.T. Rockafellar and R.J-B Wets (1976), Stochastic convex programming: relatively complete recourse and induced feasibility. SIAM J. Control and Optimization, 14 (3), 574–589.

    Article  MathSciNet  MATH  Google Scholar 

  6. R.T. Rockafellar and R.J-B Wets (1976), Stochastic convex programming: singular multipliers and extended duality, singular multipliers and duality. Pacific Journal of Mathematics, 62 (2), 507–522.

    MathSciNet  MATH  Google Scholar 

  7. R.T. Rockafellar and R.J-B Wets. (1998), Variational Analysis. Springer-Verlag.

    Google Scholar 

  8. R.J-B Wets (1992), Integral Functionals. Manuscript, University of California, Davis.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Korf, L.A. (2001). A Finite-Dimensional Approach to Infinite-Dimensional Constraints in Stochastic Programming Duality. In: Uryasev, S., Pardalos, P.M. (eds) Stochastic Optimization: Algorithms and Applications. Applied Optimization, vol 54. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-6594-6_8

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-6594-6_8

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-4855-7

  • Online ISBN: 978-1-4757-6594-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics