Logarithmic sample bounds for sample average approximation with capacity- or budget-constraints

DOI10.1016/j.orl.2021.01.007OpenAlexW3121052258MaRDI QIDQ2661625

Caleb Bugg, Anil Aswani

Publication date: 7 April 2021

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2021.01.007

zbMATH Keywords

stochastic complexitysample average approximationsample bounds

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (2)

General Feasibility Bounds for Sample Average Approximation via Vapnik--Chervonenkis Dimension ⋮ A hybrid genetic algorithm for scheduling jobs sharing multiple resources under uncertainty

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymptotic behavior of statistical estimators and of optimal solutions of stochastic optimization problems
• The sample average approximation method applied to stochastic routing problems: a computational study
• On sample size control in sample average approximations for solving smooth stochastic programs
• The Sample Average Approximation Method for Stochastic Discrete Optimization
• Optimal Budget Allocation for Sample Average Approximation
• A Sample Approximation Approach for Optimization with Probabilistic Constraints
• Lectures on Stochastic Programming
• Non-asymptotic confidence bounds for the optimal value of a stochastic program
• 10.1162/153244303321897690
• Probability Inequalities for Sums of Bounded Random Variables
• Understanding Machine Learning

This page was built for publication: Logarithmic sample bounds for sample average approximation with capacity- or budget-constraints