Restricted recourse strategies for bounding the expected network recourse function

DOI10.1007/BF02187649zbMath0856.90084MaRDI QIDQ1918432

Warren B. Powell, Linos F. Frantzeskakis

Publication date: 23 February 1997

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

zbMATH Keywords

bounds for the expected recourse functioncycle recoursenetwork recourse

Mathematics Subject Classification ID

Stochastic programming (90C15)

Related Items (1)

A successive convex approximation method for multistage workforce capacity planning problem with turnover

Cites Work

• Unnamed Item
• Refining bounds for stochastic linear programs with linearly transformed independent random variables
• Bounds on the Expectation of a Convex Function of a Multivariate Random Variable
• A tight upper bound for the expectation of a convex function of a multivariate random variable
• Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse
• A piecewise linear upper bound on the network recourse function
• A Separable Piecewise Linear Upper Bound for Stochastic Linear Programs
• Solving SLP Recourse Problems with Arbitrary Multivariate Distributions—The Dependent Case
• Bounds on the Expectation of a Convex Function of a Random Variable: With Applications to Stochastic Programming
• A Successive Linear Approximation Procedure for Stochastic, Dynamic Vehicle Allocation Problems
• Solving stochastic programming problems with recourse including error bounds
• More bounds on the expectation of a convex function of a random variable

This page was built for publication: Restricted recourse strategies for bounding the expected network recourse function