Implementing bounds-based approximations in convex-concave two-stage stochastic programming

DOI10.1007/BF02592157zbMATH Open0874.90143MaRDI QIDQ1363431FDOQ1363431

Authors: N. Chanaka P. Edirisinghe, William T. Ziemba 

Publication date: 7 August 1997

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Recommendations

• Bound-based approximations in multistage stochastic programming: nonanticipativity aggregation
• Improving aggregation bounds for two-stage stochastic programs
• Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse
• A loose Benders decomposition algorithm for approximating two-stage mixed-integer recourse models
• Bounds for Two-Stage Stochastic Programs with Fixed Recourse

zbMATH Keywords

numerical experiments\(L\)-shaped decompositionbounds on expectation of saddle functionsbounds-based approximationspartitioning strategies for rectanglessuccessive scenario clusterstwo-stage stochastic programs with fixed recourse

Mathematics Subject Classification ID

Stochastic programming (90C15)

Cites Work

• L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
• Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse
• Bounds for Two-Stage Stochastic Programs with Fixed Recourse
• Bounds on the Expectation of a Convex Function of a Random Variable: With Applications to Stochastic Programming
• Title not available (Why is that?)
• Stochastic two-stage programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Second-order scenario approximation and refinement in optimization under uncertainty

Cited In (5)

• On the safe side of stochastic programming: bounds and approximations
• Towards global solutions for nonconvex two-stage stochastic programs: a polynomial lower approximation approach
• Simulation-based confidence bounds for two-stage stochastic programs
• On a conservative partition refinement (CPR) method for a class of two-stage stochastic programming problems
• Second-order scenario approximation and refinement in optimization under uncertainty

This page was built for publication: Implementing bounds-based approximations in convex-concave two-stage stochastic programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363431)