Decomposition strategy for the stochastic pooling problem
From MaRDI portal
Publication:1928271
DOI10.1007/s10898-011-9792-0zbMath1282.90141OpenAlexW2070642658MaRDI QIDQ1928271
Asgeir Tomasgard, Xiang Li, Paul I. Barton
Publication date: 3 January 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-011-9792-0
stochastic programmingdecompositionlarge-scalenonconvex mixed-integer nonlinear programmingstochastic pooling problem
Related Items
Natural gas production network infrastructure development under uncertainty, Sample average approximation for stochastic nonconvex mixed integer nonlinear programming via outer-approximation, A generalized global optimization formulation of the pooling problem with processing facilities and composite quality constraints, Optimal design of mixed AC-DC distribution systems for commercial buildings: a nonconvex generalized Benders decomposition approach, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Computing tight bounds via piecewise linear functions through the example of circle cutting problems, GLOMIQO: global mixed-integer quadratic optimizer, Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2, Relaxations and discretizations for the pooling problem, ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations, A finite \(\epsilon\)-convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables, A generalized Benders decomposition-based branch and cut algorithm for two-stage stochastic programs with nonconvex constraints and mixed-binary first and second stage variables, QPLIB: a library of quadratic programming instances, Solving Chance-Constrained Optimization Problems with Stochastic Quadratic Inequalities
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
- A multicut algorithm for two-stage stochastic linear programs
- Partitioning procedures for solving mixed-variables programming problems
- A new reformulation-linearization technique for bilinear programming problems
- New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints
- Primal-relaxed dual global optimization approach
- Solving mixed integer nonlinear programs by outer approximation
- Duality gaps in nonconvex stochastic optimization
- A polyhedral branch-and-cut approach to global optimization
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs
- Parallel decomposition of large-scale stochastic nonlinear programs
- A branch-and-reduce approach to global optimization
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- Generalized Benders decomposition
- Pooling Problem: Alternate Formulations and Solution Methods
- Decomposition and Partitioning Methods for Multistage Stochastic Linear Programs
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- A bilinear approach to the pooling problem†
- Introduction to Stochastic Programming
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- Elements of Large-Scale Mathematical Programming Part I: Concepts
- Canonical Cuts on the Unit Hypercube
