A finite \(\epsilon\)-convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables
From MaRDI portal
Publication:2010099
DOI10.1007/s10898-019-00820-yzbMath1432.90095OpenAlexW2969792467MaRDI QIDQ2010099
Publication date: 3 December 2019
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-019-00820-y
Related Items
Scalable branching on dual decomposition of stochastic mixed-integer programming problems, Sample average approximation for stochastic nonconvex mixed integer nonlinear programming via outer-approximation, Adjustable robust optimization with objective uncertainty, A solution algorithm for chance-constrained problems with integer second-stage recourse decisions, 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
Uses Software
Cites Work
- Unnamed Item
- An algorithm for two-stage stochastic mixed-integer nonlinear convex problems
- Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs
- Cutting planes for the multistage stochastic unit commitment problem
- Two-stage quadratic integer programs with stochastic right-hand sides
- A hierarchy of relaxations for nonlinear convex generalized disjunctive programming
- The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming
- A modification of Benders' decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse
- Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problems
- Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs
- Dual decomposition in stochastic integer programming
- Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs
- Lagrangean relaxation. (With comments and rejoinder).
- Decomposition strategy for the stochastic pooling problem
- Convex programming for disjunctive convex optimization
- A progressive hedging based branch-and-bound algorithm for mixed-integer stochastic programs
- A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function
- PySP: modeling and solving stochastic programs in Python
- Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
- On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables
- Generalized Benders decomposition
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
- Improving the Integer L-Shaped Method
- Introduction to Stochastic Programming
- Extended Formulations in Mixed-Integer Convex Programming
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- JuMP: A Modeling Language for Mathematical Optimization
