Hybrid strategies using linear and piecewise-linear decision rules for multistage adaptive linear optimization
From MaRDI portal
Publication:2029922
Abstract: Decision rules offer a rich and tractable framework for solving certain classes of multistage adaptive optimization problems. Recent literature has shown the promise of using linear and nonlinear decision rules in which wait-and-see decisions are represented as functions, whose parameters are decision variables to be optimized, of the underlying uncertain parameters. Despite this growing success, solving real-world stochastic optimization problems can become computationally prohibitive when using nonlinear decision rules, and in some cases, linear ones. Consequently, decision rules that offer a competitive trade-off between solution quality and computational time become more attractive. Whereas the extant research has always used homogeneous decision rules, the major contribution of this paper is a computational exploration of hybrid decision rules. We first verify empirically that having higher uncertainty resolution or more linear pieces in early stages is more significant than having it in late stages in terms of solution quality. Then we conduct a comprehensive computational study for non-increasing (i.e., higher uncertainty resolution in early stages) and non-decreasing (i.e., higher uncertainty resolution in late stages) hybrid decision rules to illustrate the trade-off between solution quality and computational cost. We also demonstrate a case where a linear decision rule is superior to a piecewise-linear decision rule within a simulator environment, which supports the need to assess the quality of decision rules obtained from a look-ahead model within a simulator rather than just using the look-ahead model's objective function value.
Recommendations
- Design of near optimal decision rules in multistage adaptive mixed-integer optimization
- Binary decision rules for multistage adaptive mixed-integer optimization
- Two-stage linear decision rules for multi-stage stochastic programming
- Primal and dual linear decision rules in stochastic and robust optimization
- A Linear Decision-Based Approximation Approach to Stochastic Programming
Cites work
- K-adaptability in two-stage robust binary programming
- A Hierarchy of Near-Optimal Policies for Multistage Adaptive Optimization
- A Linear Decision-Based Approximation Approach to Stochastic Programming
- A survey of adjustable robust optimization
- Adjustable robust optimization via Fourier-Motzkin elimination
- Adjustable robust solutions of uncertain linear programs
- Analysis of stochastic dual dynamic programming method
- Approximate dynamic programming. Solving the curses of dimensionality
- Decision rule approximations for the risk averse reservoir management problem
- Design of near optimal decision rules in multistage adaptive mixed-integer optimization
- Distributionally robust optimization and its tractable approximations
- Ending inventory valuation in multiperiod production scheduling
- Generalized decision rule approximations for stochastic programming via liftings
- Lectures on Stochastic Programming
- Multi-stage stochastic optimization applied to energy planning
- On decision rules in stochastic programming
- Optimality of affine policies in multistage robust optimization
- Primal and dual linear decision rules in stochastic and robust optimization
- Robust approximation to multiperiod inventory management
- Robust optimization
- Stochastic dual dynamic integer programming
- The impact of the existence of multiple adjustable robust solutions
- Uncertain linear programs: extended affinely adjustable robust counterparts
Cited in
(6)- Binary decision rules for multistage adaptive mixed-integer optimization
- Finite uniform approximation of two-person games defined on a product of staircase-function infinite spaces
- Multi-deme, twin adaptive strategyhp-HGS
- Design of near optimal decision rules in multistage adaptive mixed-integer optimization
- Designing tractable piecewise affine policies for multi-stage adjustable robust optimization
- Piecewise affine decision rules for contextual chance-constrained stochastic programming
This page was built for publication: Hybrid strategies using linear and piecewise-linear decision rules for multistage adaptive linear optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2029922)
