Skip to main content
Log in

A Class of stochastic programs with decision dependent uncertainty

  • Published:
Mathematical Programming Submit manuscript

Abstract

We address a class of problems where decisions have to be optimized over a time horizon given that the future is uncertain and that the optimization decisions influence the time of information discovery for a subset of the uncertain parameters. The standard approach to formulate stochastic programs is based on the assumption that the stochastic process is independent of the optimization decisions, which is not true for the class of problems under consideration. We present a hybrid mixed-integer disjunctive programming formulation for the stochastic program corresponding to this class of problems and hence extend the stochastic programming framework. A set of theoretical properties that lead to reduction in the size of the model is identified. A Lagrangean duality based branch and bound algorithm is also presented.

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. Ahmed, S.: Strategic planning under uncertainty: Stochastic integer programming approaches. Ph.D. thesis, University of Illinois at Urbana-Champaign, 2000

  2. Balas, E.: Disjunctive programming and a hierarchy of relaxations for discrete optimization problems. SIAM Journal on Algebraic and Discrete Methods 6 (3), 466–486 (1985)

    MathSciNet  Google Scholar 

  3. Birge, J.R.: Stochastic programming computation and applications. INFORMS J. Comput. 9, 111–133 (1997)

    MATH  MathSciNet  Google Scholar 

  4. Caroe, C.C., Schultz, R.: Dual decomposition in stochastic integer programming. Oper. Res. Lett. 24, 37–45 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  5. Fisher, M.L.: The lagrangian-relaxation method for solving integer programming-problems. Management Science 27 (1), 1–18 (1981)

    MathSciNet  Google Scholar 

  6. Goel, V., Grossmann, I.E.: A stochastic programming approach to planning of offshore gas field developments under uncertainty in reserves. Computers and Chemical Engineering 28 (8), 1409–1429 (2004)

    Google Scholar 

  7. Grossmann, I. E.: Review of nonlinear mixed-integer and disjunctive programming techniques. Optimization and Engineering 3, 227–252 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  8. Guignard, M., Kim, S.: Lagrangean decomposition - A model yielding stronger lagrangean bounds. Mathematical Programming 39 (2), 215–228 (1987)

    MathSciNet  Google Scholar 

  9. Held, H., Woodruff, D.L.: Heuristics for multi-stage interdiction of stochastic networks. Journal of Heuristics (Submitted for publication)

  10. Hooker, J.: Logic-based methods for optimization: combining optimization and constraint satisfaction. New York : John Wiley and Sons 2000

  11. Jonsbraten, T.W.: Optimization models for petroleum field exploitation. Ph.D. thesis, Norwegian School of Economics and Business Administration (1998)

  12. Jonsbraten, T.W., Wets, R.J.B., Woodruff, D.L.: A class of stochastic programs with decision dependent random elements. Annals of Operations Research 82, 83–106 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  13. Jorjani, S., Scott, C.H., Woodruff, D.L.: Selection of an optimal subset of sizes. International Journal of Production Research 37 (16), 3697–3710 (1999)

    Article  Google Scholar 

  14. Krarup, J., Bilde, O.: Plant location, set covering and economic lot size: an O(mn)-algorithm for structured problems. In: Collatz L., Wetterling W., (eds.); Optimierung bei graphentheoretischen and ganzzahligen Problemen. Vol. 36 of International Series of Numerical Mathematics. Birkhauser Verlag, Basel, 155–180 (1977)

  15. Nemhauser, G.L., Wolsey, L.A.: Integer and combinatorial optimization. Wiley, New York, English Series: Wiley-Interscience series in discrete mathematics and optimization 1988

  16. Pflug, G.: On-line optimization of simulated markovian processes. Math. Oper. Res. 15 (3), 381–395 (1990)

    MathSciNet  Google Scholar 

  17. Rockafellar, R., Wets, R. J.-B.: Scenarios and policy aggregation in optimization under uncertainty. Math. Oper. Res. 16, 119–147 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  18. Ruszczynski, A.: Decomposition methods in stochastic programming. Math. Programming (Ser. B) 79, 333–353 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  19. Sahinidis, N.V.: Optimization under uncertainty: State-of-the-art and opportunities. Comput. Chem. Eng. 28 (6–7), 971–983 (2004)

    Google Scholar 

  20. Schultz, R.: Stochastic programming with integer variables. Mathematical Programming 97 (1–2), 285–309 (2003)

  21. Turkay, M., Grossmann, I.E.: Disjunctive programming techniques for the optimization of process systems with discontinuous investment costs multiple size regions. Ind. Eng. Chem. Res. 35, 2611–2623 (1996)

    Article  Google Scholar 

  22. Viswanath, K., Peeta, S., Salman, S.: Investing in the links of a stochastic network to minimize expected shortest path length (Working paper)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ignacio E. Grossmann.

Additional information

Financial support from the ExxonMobil Upstream Research Company is gratefully acknowledged.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Goel, V., Grossmann, I. A Class of stochastic programs with decision dependent uncertainty. Math. Program. 108, 355–394 (2006). https://doi.org/10.1007/s10107-006-0715-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-006-0715-7

Keywords

Navigation