Scenarios and Policy Aggregation in Optimization Under Uncertainty

DOI10.1287/MOOR.16.1.119zbMATH Open0729.90067DBLPjournals/mor/RockafellarW91OpenAlexW1969007958WikidataQ89283043 ScholiaQ89283043MaRDI QIDQ3354472FDOQ3354472

Authors: Roger J.-B. Wets, R. T. Rockafellar 

Publication date: 1991

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/6f2e62b12a803ee8f01725226a3d4a6aba86b6da

Recommendations

• scientific article; zbMATH DE number 773966
• Scenario analysis via bundle decomposition
• Scenario relaxation algorithm for finite scenario-based min-max regret and min-max relative regret robust optimization
• Scenario optimization
• A scenario aggregation algorithm for the solution of stochastic dynamic minimax problems

zbMATH Keywords

augmented Lagrangianproximal point algorithmrobust decisionsscenario analysismultistage optimization problems under uncertainty

Mathematics Subject Classification ID

Stochastic programming (90C15) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cited In (only showing first 100 items - show all)

• A stochastic 0-1 program based approach for the air traffic flow management problem
• Time consistency and risk averse dynamic decision models: definition, interpretation and practical consequences
• Sampling Scenario Set Partition Dual Bounds for Multistage Stochastic Programs
• PySP: modeling and solving stochastic programs in Python
• A scalable solution framework for stochastic transmission and generation planning problems
• Progressive hedging-based metaheuristics for stochastic network design
• Decomposition algorithm for large-scale two-stage unit-commitment
• A general algorithm for solving two-stage stochastic mixed \(0-1\) first-stage problems
• Solving stochastic transportation network protection problems using the progressive hedging-based method
• BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs.
• Dual decomposition in stochastic integer programming
• Robust solutions of uncertain linear programs
• Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs
• An XML-based schema for stochastic programs
• A preconditioning technique for Schur complement systems arising in stochastic optimization
• Scenario grouping in a progressive hedging-based meta-heuristic for stochastic network design
• Scenario cluster decomposition of the Lagrangian dual in two-stage stochastic mixed 0-1 optimization
• An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees
• Cost/risk balanced management of scarce resources using stochastic programming
• Decomposition methods in stochastic programming
• Parallel processors for planning under uncertainty
• Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problems
• On a mixture of the fix-and-relax coordination and Lagrangian substitution schemes for multistage stochastic mixed integer programming
• Convergent cutting-plane and partial-sampling algorithm for multistage stochastic linear programs with recourse
• A stochastic bi-objective location model for strategic reverse logistics
• A finite \(\epsilon\)-convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables
• Two-stage stochastic variational inequalities: theory, algorithms and applications
• An enhanced decomposition algorithm for multistage stochastic hydroelectric scheduling
• Dynamic portfolio optimization: time decomposition using the maximum principle with a scenario approach
• Strategic financial risk management and operations research
• Scenario generation and stochastic programming models for asset liability management
• Duality gaps in nonconvex stochastic optimization
• Stochastic programming for optimizing bidding strategies of a Nordic hydropower producer
• Stochastic Dual Dynamic Programming for Multiechelon Lot Sizing with Component Substitution
• On stochastic dynamic programming for solving large-scale planning problems under uncertainty
• A branch and bound method for stochastic global optimization
• A variable-penalty alternating directions method for convex optimization
• Duality and statistical tests of optimality for two stage stochastic programs
• A hybrid scenario cluster decomposition algorithm for supply chain tactical planning under uncertainty
• Logistics capacity planning: a stochastic bin packing formulation and a progressive hedging meta-heuristic
• Progressive hedging applied as a metaheuristic to schedule production in open-pit mines accounting for reserve uncertainty
• Optimal booking and scheduling in outpatient procedure centers
• Cluster Lagrangean decomposition in multistage stochastic optimization
• Stochastic unit commitment problem
• Large-scale unit commitment under uncertainty
• A survey on metaheuristics for stochastic combinatorial optimization
• Tracking error: a multistage portfolio model
• Scenario cluster Lagrangean decomposition for risk averse in multistage stochastic optimization
• BFC-MSMIP: an exact branch-and-fix coordination approach for solving multistage stochastic mixed 0-1 problems
• On multistage stochastic integer programming for incorporating logical constraints in asset and liability management under uncertainty
• Stage- and scenario-wise Fenchel decomposition for stochastic mixed 0-1 programs with special structure
• Computational aspects in applied stochastic control
• On \(BFC-MSMIP\) strategies for scenario cluster partitioning, and twin node family branching selection and bounding for multistage stochastic mixed integer programming
• Progressive hedging as a meta-heuristic applied to stochastic lot-sizing
• Integration of progressive hedging and dual decomposition in stochastic integer programs
• Lagrangian decomposition for large-scale two-stage stochastic mixed 0-1 problems
• Simulation-based confidence bounds for two-stage stochastic programs
• Importance sampling in stochastic programming: a Markov chain Monte Carlo approach
• Measuring and maximizing resilience of freight transportation networks
• Schumann, a modeling framework for supply chain management under uncertainty
• Two-stage stochastic programming supply chain model for biodiesel production via wastewater treatment
• Supply chain design under uncertainty using sample average approximation and dual decomposition
• A so-called cluster Benders decomposition approach for solving two-stage stochastic linear problems
• Portfolio optimization for wealth-dependent risk preferences
• A Lagrangian dual method with self-concordant barriers for multi-stage stochastic convex programming
• On a stochastic sequencing and scheduling problem
• New strategies for stochastic resource-constrained project scheduling
• Survey of mathematical programming models in air pollution management
• On augmented Lagrangian decomposition methods for multistage stochastic programs
• Scenario decomposable subgradient projection method for two-stage stochastic programming with convex risk measures
• Application of the scenario aggregation approach to a two-stage, stochastic, common component, inventory problem with a budget constraint
• A multiobjective metaheuristic for a mean-risk static stochastic knapsack problem
• Using scenario trees and progressive hedging for stochastic inventory routing problems
• Solving long-term financial planning problems via global optimization
• CORO, a modeling and an algorithmic framework for oil supply, transformation and distribution optimization under uncertainty
• A heuristic procedure for stochastic integer programs with complete recourse
• Structuring bilateral energy contract portfolios in competitive markets
• The value of the stochastic solution in multistage problems
• A class of stochastic programs with decision dependent uncertainty
• A stochastic production planning problem with nonlinear cost
• Applying the minimax criterion in stochastic recourse programs
• The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
• SOCRATES: A system for scheduling hydroelectric generation under uncertainty
• A multi-stage stochastic programming approach for production planning with uncertainty in the quality of raw materials and demand
• Genetic algorithm based technique for solving chance constrained problems
• Soft clustering-based scenario bundling for a progressive hedging heuristic in stochastic service network design
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• A multistage linear stochastic programming model for optimal corporate debt management
• A local convergence analysis of bilevel decomposition algorithms
• Developing childhood vaccine administration and inventory replenishment policies that minimize open vial wastage
• On the number of stages in multistage stochastic programs
• Statistical estimation of operating reserve requirements using rolling horizon stochastic optimization
• Discrete approximation of two-stage stochastic and distributionally robust linear complementarity problems
• Integrated Stochastic Optimal Self-Scheduling for Two-Settlement Electricity Markets
• Design of non-parametric process-specific optimal tuning rules for PID control of flow loops
• Mathematical programming approaches for generating \(p\)-efficient points
• Re-solving stochastic programming models for airline revenue management
• Analysis of stochastic problem decomposition algorithms in computational grids
• Randomized progressive hedging methods for multi-stage stochastic programming
• Minimizing value-at-risk in single-machine scheduling

This page was built for publication: Scenarios and Policy Aggregation in Optimization Under Uncertainty

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