Problem-based optimal scenario generation and reduction in stochastic programming
From MaRDI portal
Publication:2118075
DOI10.1007/s10107-018-1337-6zbMath1491.90105OpenAlexW2895500395MaRDI QIDQ2118075
Publication date: 22 March 2022
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-018-1337-6
Related Items
Fast scenario reduction by conditional scenarios in two-stage stochastic MILP problems, From scenarios to conditional scenarios in two‐stage stochastic MILP problems, Problem-driven scenario clustering in stochastic optimization, On solving large-scale multistage stochastic optimization problems with a new specialized interior-point approach, A Stochastic Integer Programming Approach to Air Traffic Scheduling and Operations, Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scenario construction and reduction applied to stochastic power generation expansion planning
- Mixed integer linear programming formulations for probabilistic constraints
- Scenario reduction in stochastic programming with respect to discrepancy distances
- An integer programming approach for linear programs with probabilistic constraints
- Generalized semi-infinite programming: a tutorial
- Discrepancy distances and scenario reduction in two-stage stochastic mixed-integer programming
- Discretization methods for the solution of semi-infinite programming problems
- Mass transportation problems. Vol. 1: Theory. Vol. 2: Applications
- A space quantization method for numerical integration
- Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra
- Scenario reduction in stochastic programming
- Bi-level strategies in semi-infinite programming.
- A polyhedral study on chance constrained program with random right-hand side
- Epi-convergent discretizations of stochastic programs via integration quadratures
- On generalized semi-infinite optimization and bilevel optimization
- Scenario reduction algorithms in stochastic programming
- Foundations of quantization for probability distributions
- Quasi-Monte Carlo methods for linear two-stage stochastic programming problems
- A note on scenario reduction for two-stage stochastic programs
- Lifting projections of convex polyhedra
- A transformation-based discretization method for solving general semi-infinite optimization problems
- Generalized semi-infinite programming: numerical aspects
- Approximating $k$-Median via Pseudo-Approximation
- Semi-Infinite Programming: Theory, Methods, and Applications
- Stability of $\varepsilon$-approximate Solutions to Convex Stochastic Programs
- Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse
- Solving SLP Recourse Problems with Arbitrary Multivariate Distributions—The Dependent Case
- Regularity and Stability for Convex Multivalued Functions
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Stochastic Programs with Fixed Recourse: The Equivalent Deterministic Program
- New Second-Order Bounds on the Expectation of Saddle Functions with Applications to Stochastic Linear Programming
- Variational Analysis
- Approximations for Probability Distributions and Stochastic Optimization Problems
- Local Search Heuristics for k-Median and Facility Location Problems
- High-dimensional integration: The quasi-Monte Carlo way
- The Speed of Mean Glivenko-Cantelli Convergence
- Quantitative Stability in Stochastic Programming: The Method of Probability Metrics
- Second-Order Lower Bounds on the Expectation of a Convex Function
- Scenarios for multistage stochastic programs
