Simplifying Complexity: Scenario Reduction Techniques in Stochastic Programming


  • Christian Sinaga Magister of Mathematics, Universitas Sumatera Utara, Indonesia
  • Tulus Department of Mathematics, Universitas Sumatera Utara, Indonesia
  • Herman Mawengkang Department of Mathematics, Universitas Sumatera Utara, Indonesia




Scenario reduction, Two-stage, Stochastic programming


Stochastic programming problems arise as mathematical models for optimizing problems under stochastic uncertainty. Computational approaches for solving these models often involve approximating the underlying probability distribution with a probability measure that has finite support. To mitigate the computational complexity associated with increasing the number of scenarios, it may be necessary to reduce their quantity. The scenario  is selected as the first element of supp , and the separable structure is used to determine the second element of supp  while keeping the first element fixed. The process is repeated to establish the remaining indices, and each subsequent scenario is reduced accordingly. This iterative process continues until scenario  is reduced

GS Cited Analysis


Download data is not yet available.

Author Biographies

Christian Sinaga, Magister of Mathematics, Universitas Sumatera Utara, Indonesia



Tulus, Department of Mathematics, Universitas Sumatera Utara, Indonesia



Herman Mawengkang, Department of Mathematics, Universitas Sumatera Utara, Indonesia




Ahmed, S., King, A. J., & Parija, G. (2003). A multi-stage stochastic integer programming approach for capacity expansion under uncertainty. Journal of Global Optimization, 26, 3–24.

Beltratti, A., Consiglio, A., & Zenios, S. A. (1999). Scenario modeling for the management ofinternational bond portfolios. Annals of Operations Research, 85(0), 227–247.

Birge, J. R., & Dempstert, M. A. H. (1996). Stochastic programming approaches to stochastic scheduling. Journal of Global Optimization, 9(3–4), 417–451.

Chen, H.-H., & Yang, C.-B. (2017). Multiperiod portfolio investment using stochastic programming with conditional value at risk. Computers & Operations Research, 81, 305–321.

Consiglio, A., Carollo, A., & Zenios, S. A. (2014). Generating multi-factor arbitrage-free scenario trees with global optimization.

Dantzig, G. B. (1955). Linear programming under uncertainty. Management Science, 1(3–4), 197–206.

Dempster, M. A. H., Hicks Pedron, N., Medova, E. A., Scott, J. E., & Sembos, A. (2000). Planning logistics operations in the oil industry. Journal of the Operational Research Society, 51(11), 1271–1288.

Doğru, M. K., Reiman, M. I., & Wang, Q. (2010). A stochastic programming based inventory policy for assemble-to-order systems with application to the W model. Operations Research, 58(4-part-1), 849–864.

Dupacová, J. (1995). Scenario-based stochastic programs: Strategies for deleting scenarios.

Dupačová, J., Gaivoronski, A., Kos, Z., & Szántai, T. (1991). Stochastic programming in water management: A case study and a comparison of solution techniques. European Journal of Operational Research, 52(1), 28–44.

Fleten, S.-E., & Kristoffersen, T. K. (2008). Short-term hydropower production planning by stochastic programming. Computers & Operations Research, 35(8), 2656–2671.

Heitsch, H., & Römisch, W. (2003). Scenario reduction algorithms in stochastic programming. Computational Optimization and Applications, 24(2), 187–206.

Hemmati, R. (2019). Stochastic energy investment in off‐grid renewable energy hub for autonomous building. IET Renewable Power Generation, 13(12), 2232–2239.

Higle, J. L., Rayco, B., & Sen, S. (2010). Stochastic scenario decomposition for multistage stochastic programs. IMA Journal of Management Mathematics, 21(1), 39–66.

Hochreiter, R., & Pflug, G. (2002). Scenario tree generation as a multidimensional facility location problem. AURORA Technical Report, Department of Statistics and Decision Support Systems, University of Vienna.

Høyland, K., Kaut, M., & Wallace, S. W. (2003). A heuristic for moment-matching scenario generation. Computational Optimization and Applications, 24, 169–185.

Hu, S.-L., Han, C.-F., & Meng, L.-P. (2017). Stochastic optimization for joint decision making of inventory and procurement in humanitarian relief. Computers & Industrial Engineering, 111, 39–49.

Huang, G. H., & Loucks, D. P. (2000). An inexact two-stage stochastic programming model for water resources management under uncertainty. Civil Engineering Systems, 17(2), 95–118.

Kenyon, A. S., & Morton, D. P. (2003). Stochastic vehicle routing with random travel times. Transportation Science, 37(1), 69–82.

Kuhn, D. (2006). Generalized bounds for convex multistage stochastic programs (Vol. 548). Springer Science & Business Media.

Li, Y. P., Huang, G. H., Huang, Y. F., & Zhou, H. D. (2009). A multistage fuzzy-stochastic programming model for supporting sustainable water-resources allocation and management. Environmental Modelling & Software, 24(7), 786–797.

Mulvey, J. M., & Vladimirou, H. (1991). Applying the progressive hedging algorithm to stochastic generalized networks. Annals of Operations Research, 31(1), 399–424.

Niknam, T., Azizipanah-Abarghooee, R., & Narimani, M. R. (2012). An efficient scenario-based stochastic programming framework for multi-objective optimal micro-grid operation. Applied Energy, 99, 455–470.

Paul, J. A., & Zhang, M. (2019). Supply location and transportation planning for hurricanes: A two-stage stochastic programming framework. European Journal of Operational Research, 274(1), 108–125.

Sen, S., & Higle, J. L. (2000). The C3 theorem and a D2 algorithm for large scale stochastic integer programming: Set convexification. Stochastic E-Print Series.

Shapiro, A., Dentcheva, D., & Ruszczynski, A. (2021). Lectures on stochastic programming: modeling and theory. SIAM.

Wang, Y. (2010). Scenario reduction heuristics for a rolling stochastic programming simulation of bulk energy flows with uncertain fuel costs. Iowa State University.


Crossmark Updates

How to Cite

Sinaga, C., Tulus, T., & Mawengkang, H. (2023). Simplifying Complexity: Scenario Reduction Techniques in Stochastic Programming. Sinkron : Jurnal Dan Penelitian Teknik Informatika, 7(3), 1821-1831.