Computational strategies for non-convex multistage MINLP models with decision-dependent uncertainty and~gradual uncertainty resolution
DOI10.1007/s10479-011-0855-xzbMath1269.90073OpenAlexW2067867177MaRDI QIDQ2393472
Bora Tarhan, Vikas Goel, Ignacio E. Grossmann
Publication date: 8 August 2013
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-011-0855-x
global optimizationmultistage stochastic programmingdecision making under uncertaintydecision dependent uncertaintyouter-approximationgradual uncertainty resolutionnon-convex mixed integer nonlinear programoil or gas field explorationsynthesis of process networks
Decision theory (91B06) Nonconvex programming, global optimization (90C26) Stochastic programming (90C15)
Related Items (14)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A class of stochastic programs with decision dependent random elements
- Decomposition methods in stochastic programming
- Stochastic programming with integer variables
- Heuristics for multi-stage interdiction of stochastic networks
- A class of stochastic programs with decision dependent uncertainty
- Linear Programming under Uncertainty
- The Sample Average Approximation Method for Stochastic Discrete Optimization
- On-Line Optimization of Simulated Markovian Processes
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints
This page was built for publication: Computational strategies for non-convex multistage MINLP models with decision-dependent uncertainty and~gradual uncertainty resolution