Decomposition strategy for the stochastic pooling problem
From MaRDI portal
Publication:1928271
DOI10.1007/S10898-011-9792-0zbMATH Open1282.90141OpenAlexW2070642658MaRDI QIDQ1928271FDOQ1928271
Authors: Xiang Li, Asgeir Tomasgard, 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
Recommendations
- A Decomposition Strategy for Global Optimum Search in the Pooling Problem
- A bilinear approach to the pooling problem†
- Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs
- Dual decomposition in stochastic integer programming
- Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
decompositionlarge-scalestochastic programmingnonconvex mixed-integer nonlinear programmingstochastic pooling problem
Cites Work
- Partitioning procedures for solving mixed-variables programming problems
- Title not available (Why is that?)
- A multicut algorithm for two-stage stochastic linear programs
- Solving mixed integer nonlinear programs by outer approximation
- A polyhedral branch-and-cut approach to global optimization
- Generalized Benders decomposition
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Introduction to Stochastic Programming
- 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
- Duality gaps in nonconvex stochastic optimization
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- A new reformulation-linearization technique for bilinear programming problems
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- A branch-and-reduce approach to global optimization
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Pooling problem: alternate formulations and solution methods
- A bilinear approach to the pooling problem†
- Advances for the pooling problem: modeling, global optimization, and computational studies (Survey)
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
- Decomposition and Partitioning Methods for Multistage Stochastic Linear Programs
- Primal-relaxed dual global optimization approach
- Parallel decomposition of large-scale stochastic nonlinear programs
- Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs
- New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints
Cited In (17)
- Optimal design of mixed AC-DC distribution systems for commercial buildings: a nonconvex generalized Benders decomposition approach
- QPLIB: a library of quadratic programming instances
- A new statistical strategy for pooling: ELI
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- A Decomposition Strategy for Global Optimum Search in the Pooling Problem
- A generalized global optimization formulation of the pooling problem with processing facilities and composite quality constraints
- A finite \(\epsilon\)-convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables
- 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
- Natural gas production network infrastructure development under uncertainty
- GLOMIQO: global mixed-integer quadratic optimizer
- STG decomposition strategies in combination with unfolding
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Sample average approximation for stochastic nonconvex mixed integer nonlinear programming via outer-approximation
- 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
- Relaxations and discretizations for the pooling problem
- Solving chance-constrained optimization problems with stochastic quadratic inequalities
Uses Software
This page was built for publication: Decomposition strategy for the stochastic pooling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1928271)
