Skip to main content
Log in

Simple integer recourse models: convexity and convex approximations

  • Published:
Mathematical Programming Submit manuscript

Abstract

We consider the objective function of a simple recourse problem with fixed technology matrix and integer second-stage variables. Separability due to the simple recourse structure allows to study a one-dimensional version instead.

Based on an explicit formula for the objective function, we derive a complete description of the class of probability density functions such that the objective function is convex. This result is also stated in terms of random variables.

Next, we present a class of convex approximations of the objective function, which are obtained by perturbing the distributions of the right-hand side parameters. We derive a uniform bound on the absolute error of the approximation. Finally, we give a representation of convex simple integer recourse problems as continuous simple recourse problems, so that they can be solved by existing special purpose algorithms.

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. Birge, J.R., Louveaux, F.V.: Introduction to Stochastic Programming. Springer Verlag, New York (1997)

  2. Kall, P., Wallace, S.W.: Stochastic Programming. Wiley, Chichester (1994). Also available as PDF file at http://www.unizh.ch/ior/Pages/Deutsch/Mitglieder/Kall/bib/ka-wal-94.pdf

  3. Klein Haneveld, W.K., Stougie, L., van der Vlerk, M.H.: On the convex hull of the simple integer recourse objective function. Ann. Oper. Res. 56, 209–224 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  4. Klein Haneveld, W.K., Stougie, L., van der Vlerk, M.H.: An algorithm for the construction of convex hulls in simple integer recourse programming. Ann. Oper. Res. 64, 67–81 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  5. Klein Haneveld, W.K., van der Vlerk, M.H.: Stochastic integer programming: General models and algorithms. Ann. Oper. Res. 85, 39–57 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  6. Louveaux, F.V., Schultz, R.: Stochastic integer programming. In: A. Ruszczynski, A. Shapiro (eds.) Stochastic Programming, chap. 4, pp. 213–266. Elsevier (2003). Handbooks in Operations Research and Management Science, vol. 10

  7. Louveaux, F.V., van der Vlerk, M.H.: Stochastic programming with simple integer recourse. Math. Program. 61, 301–325 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  8. Mayer, J.: Stochastic Linear Programming Algorithms: A Comparison Based on a Model Management System. Optimization theory and applications; v. 1. Gordon and Breach Science Publishers, OPA Amsterdam, The Netherlands (1998)

  9. Nesterov, Yu., Nemirovski, A.: Interior point polynomial methods in Convex Programming: theory and applications. SIAM Series in Applied Mathematics. SIAM (1994)

  10. Prékopa, A.: Stochastic Programming. Kluwer Academic Publishers, Dordrecht (1995)

  11. Rudin, W.: Principles of Mathematical Analysis, second edn. McGraw-Hill, New York (1964)

  12. Ruszczynski, A., Shapiro, A. (eds.): Stochastic Programming, Handbooks in Operations Research and Management Science, vol. 10. Elsevier (2003)

  13. Schultz, R.: Continuity properties of expectation functions in stochastic integer programming. Math. Oper. Res. 18, 578–589 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  14. Stochastic programming introduction.Stochastic Programming Community Home Page sponsored by COSP, http://stoprog.org

  15. Stougie, L., van der Vlerk, M.H.: Stochastic integer programming. In: M. Dell'Amico, F. Maffioli, S. Martello (eds.) Annotated Bibliographies in Combinatorial Optimization, chap. 9, pp. 127–141. Wiley (1997)

  16. van der Vlerk, M.H.: Stochastic programming with integer recourse. Ph.D. thesis, University of Groningen, The Netherlands (1995)

  17. van der Vlerk, M.H.: On multiple simple recourse models. Math. Methods of OR 62 (2), 225–242 (2005)

    Article  Google Scholar 

  18. van der Vlerk, M.H.: Simplification of recourse models by modification of recourse data. In: K. Marti, Y. Ermoliev, G. Pflug (eds.) Dynamic Stochastic Optimization, pp. 321–336. Springer (2003). Lecture Notes in Economics and Mathematical Systems, vol. 532

  19. van der Vlerk, M.H.: Convex approximations for complete integer recourse models. Math. Program. 99(2), 297–310 (2004)

    Article  MathSciNet  Google Scholar 

  20. van der Vlerk, M.H.: Convex approximations for a class of mixed-integer recourse models. Research Report 2005–10, Stochastic Programming E-Print Series, http://www.speps.info (2005)

  21. Wets, R.J-B.: Solving stochastic programs with simple recourse. Stochastics 10, 219–242 (1984)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Maarten H. van der Vlerk.

Additional information

Research of the third author has been made possible by a fellowship of the Royal Netherlands Academy of Arts and Sciences.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Klein Haneveld, W., Stougie, L. & van der Vlerk, M. Simple integer recourse models: convexity and convex approximations. Math. Program. 108, 435–473 (2006). https://doi.org/10.1007/s10107-006-0718-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-006-0718-4

Keywords

Navigation