Aug 2026· Dhaka University Journal of Science· 0 citations· 16 references
TL;DR
This study presents an overview of stochastic integer programming (SIP) and its applications and highlights key methodologies such as two-stage and multi-stage models, LP-relaxation, and recourse strategies.
Abstract
Uncertainty is inherent in real-world decision-making. Traditional deterministic models often fail to capture such variability, leading to sub optimal or infeasible results. Stochastic programming provides a robust mathematical framework for optimization under uncertainty. This study presents an overview of stochastic integer programming (SIP) and its applications. After introducing the fundamentals of stochastic programming, we review existing literature and highlight key methodologies such as two-stage and multi-stage models, LP-relaxation, and recourse strategies. Practical examples solved using AMPL and Mathematica are provided to demonstrate the applicability of SIP in real-life decision problems. The findings emphasize the significance of SIP as a versatile tool for optimization under uncertainty and as a foundation for future research.
Dhaka Univ. J. Sci. 74(2): 283–294, 2026 (July)
Uncertainty poses a significant challenge for optimization algorithms in real-world applications. As these algorithms become more sophisticated, there is an increasing need for them to produce reliable and explainable decisions under uncertain conditions. This article introduces knowledge-enabled explainable chance-con...
Jeng-Shyang Pan, Pei-Cheng Song, Ning Zhong et al.· IEEE Transactions on Cyberne...· 0 citations
The results show that the heuristic closes the optimality gap for a significant portion of the considered instances and often practically outperforms both heuristic and exact benchmark approaches.
The article describes a technique for solving multiobjective stochastic optimization problems. As a generalized model of a stochastic system to be optimized a vector (input-random output) system is used. Ran- dom outputs are converted into a vector of deterministic performance and risk indicators. The problem is to fin...
This paper shows how an intuitive mapping from descriptive problem to optimization model can be realized with Constraint Programming (CP), and shows how a CP model can be constructed given a simulation model and a set of business goals.
Sytze P. E. Andringa, Neil Yorke-Smith· 0 citations
The contribution is a proof that there exist measurable versions of intermediate value functions, which reveals regularity in addition, and a verification theorems allow stating traditional problem specifications in the novel setting with mathematical rigor.
Paul Dommel, Alois Pichler· Journal of Convex Analysis· 2 citations
This paper investigates computationally efficient methods for deriving bounds on the optimal value of multi-horizon stochastic optimization problems, with a particular focus on applications in power generation and transmission expansion planning. Multi-horizon stochastic programs capture sequential decision-making unde...
Giovanni Micheli, V. Varagapriya, Francesca Maggioni et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
