On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
From MaRDI portal
Publication:5704184
DOI10.1287/moor.1040.0094zbMath1082.90124OpenAlexW2158479468MaRDI QIDQ5704184
Benjamin van Roy, Daniela Pucci de Farias
Publication date: 11 November 2005
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.1040.0094
Large-scale problems in mathematical programming (90C06) Queues and service in operations research (90B22) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Dynamic programming (90C39)
Related Items (57)
Least squares policy iteration with instrumental variables vs. direct policy search: comparison against optimal benchmarks using energy storage ⋮ Predictive stochastic programming ⋮ Generalized maximum entropy estimation ⋮ The CoMirror algorithm with random constraint sampling for convex semi-infinite programming ⋮ A smooth approximation approach for optimization with probabilistic constraints based on sigmoid function ⋮ Approximate dynamic programming for stochastic linear control problems on compact state spaces ⋮ A new learning algorithm for optimal stopping ⋮ Technical Note—Product-Based Approximate Linear Programs for Network Revenue Management ⋮ Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds ⋮ APPROXIMATE DYNAMIC PROGRAMMING TECHNIQUES FOR THE CONTROL OF TIME-VARYING QUEUING SYSTEMS APPLIED TO CALL CENTERS WITH ABANDONMENTS AND RETRIALS ⋮ ONLINE CAPACITY PLANNING FOR REHABILITATION TREATMENTS: AN APPROXIMATE DYNAMIC PROGRAMMING APPROACH ⋮ Approximate linear programming for networks: average cost bounds ⋮ Unnamed Item ⋮ Symmetric approximate linear programming for factored MDPs with application to constrained problems ⋮ From Infinite to Finite Programs: Explicit Error Bounds with Applications to Approximate Dynamic Programming ⋮ Scenario approximation of robust and chance-constrained programs ⋮ General Feasibility Bounds for Sample Average Approximation via Vapnik--Chervonenkis Dimension ⋮ On safe tractable approximations of chance constraints ⋮ Dynamic inventory control with payment delay and credit limit ⋮ A bi‐level programming framework for identifying optimal parameters in portfolio selection ⋮ Decomposable Markov Decision Processes: A Fluid Optimization Approach ⋮ Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness ⋮ Efficient approximate linear programming for factored MDPs ⋮ Simple and fast algorithm for binary integer and online linear programming ⋮ Reductions of non-separable approximate linear programs for network revenue management ⋮ Network revenue management with inventory-sensitive bid prices and customer choice ⋮ Efficient compact linear programs for network revenue management ⋮ Worst-case violation of sampled convex programs for optimization with uncertainty ⋮ A framework and a mean-field algorithm for the local control of spatial processes ⋮ Approximate dynamic programming for capacity allocation in the service industry ⋮ Computational bounds for elevator control policies by large scale linear programming ⋮ Using mathematical programming to solve factored Markov decision processes with imprecise probabilities ⋮ Spare Parts Inventory Management with Substitution-Dependent Reliability ⋮ Relationship between least squares Monte Carlo and approximate linear programming ⋮ Linear programming formulation for non-stationary, finite-horizon Markov decision process models ⋮ Shape constraints in economics and operations research ⋮ Network-Based Approximate Linear Programming for Discrete Optimization ⋮ Randomized sampling for large zero-sum games ⋮ Genetic algorithm based technique for solving chance constrained problems ⋮ Identifying proactive ICU patient admission, transfer and diversion policies in a public-private hospital network ⋮ Computing near-optimal value-at-risk portfolios using integer programming techniques ⋮ A sampling-and-discarding approach to chance-constrained optimization: feasibility and Optimality ⋮ Uncertain convex programs: randomized solutions and confidence levels ⋮ Partially observable Markov decision process approximations for adaptive sensing ⋮ Ambiguous chance constrained problems and robust optimization ⋮ Saddle point approximation approaches for two-stage robust optimization problems ⋮ Reductions of Approximate Linear Programs for Network Revenue Management ⋮ Dynamic programming and suboptimal control: a survey from ADP to MPC ⋮ Linear Programming and the Control of Diffusion Processes ⋮ Computing Near-Optimal Policies in Generalized Joint Replenishment ⋮ Random Projections for Linear Programming ⋮ Gradient-bounded dynamic programming for submodular and concave extensible value functions with probabilistic performance guarantees ⋮ Data-driven optimal control with a relaxed linear program ⋮ An inexact primal-dual algorithm for semi-infinite programming ⋮ Approximate dynamic programming via iterated Bellman inequalities ⋮ Probabilistic Guarantees in Robust Optimization ⋮ Monte Carlo Methods for Value-at-Risk and Conditional Value-at-Risk
This page was built for publication: On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
