Abstract
This paper presents bounds for the expected recourse function for stochastic programs with network recourse. Cyclic recourse, a concept introduced by Wallace [18], allows the approximation of the recourse problem by restricting the optimal flows on a set of cycles and by augmenting the original network to induce separability. We introduce a new procedure that uses again a set of cycles but does not approximate the problem; instead it solves it heuristically without altering the original network or requiring separability. The method produces tighter bounds and is computationally feasible for large networks. Numerical experiments with selected networks illustrate the effectiveness of the approach.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. Ben-Tal and E. Hochman, More bounds on the expectation of a convex function of a random variable, J. Applied Probability 9, 1972, 803–812.
J.R. Birge and R.J-B Wets, Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse, Mathematical Programming Study 27, 1986, 54–102.
J.R. Birge and S.W. Wallace, Refining bounds for stochastic linear programs with linearly transformed independent random variables, Operations Research Letters 5, 1986, 73–77.
J.R. Birge and S.W. Wallace, A separable piecewise linear upper bound for stochastic linear programs, SIAM J. Control and Optimization 26, 1988, 725–739.
L.F. Frantzeskakis and W. B. Powell, A successive linear approximation procedure for stochastic dynamic vehicle allocation problems, Transportation Science 24, 1990, 40–57.
L.F. Frantzeskakis and W. B. Powell, Bounding procedures for dynamic networks with random link capacities, with application to stochastic programming, submitted to Networks, 1989.
K. Frauendorfer, Solving SLP recourse problems with arbitrary multivariate distributions — the dependent case, Mathematics of Operations Research 13, 1988, 377–394.
H. Gassmann and W.T. Ziemba, A tight upper bound for the expectation of a convex function of a multivariate random variable, Mathematical Programming Study 27, 1986, 39–53.
C.C. Huang, W.T. Ziemba and A. Ben-Tal, Bounds on the expectation of a convex function of a random variable: With applications to stochastic programming, Operations Research 25, 1977, 315–325.
W.C. Jordan and M. A. Turnquist, A stochastic, dynamic model for railroad car distribution, Transportation Science 17, 1983, 123–145.
P. Kall and D. Stoyan, Solving stochastic programming problems with recourse including error bounds, Math. Operationsforsch. Statist., Ser. Optimization 13, 1982, 431–447.
A. Madansky, Bounds on the expectation of a convex function of a multivariate random variable, Annals of Mathematical Statistics 30, 1959, 743–746.
W.B. Powell, Y. Sheffi and S. Thiriez, The dynamic vehicle allocation problem with uncertain demands, inNinth International Symposium on Transportation and Traffic Theory, VNU Science Press, Utrecht, 1984.
W.B. Powell, A stochastic model of the dynamic vehicle allocation problem, Transportation Science 20, 1986, 117–129.
W.B. Powell, An operational planning model for the dynamic vehicle allocation problem with uncertain demands, Transportation Research 21B, 1987, 217–232.
W.B. Powell, Y. Sheffi, K.S. Nickerson, K. Butterbaugh and S. Atherton, Maximizing profits for North American van lines' truckload division: A new framework for pricing and operations, Interfaces 18, 1988, 21–41.
R.T. Rockafellar,Network Flows and Monotropic Optimization, Wiley, New York, 1984.
S.W. Wallace, A piecewise linear upper bound on the network recourse function, Mathematical Programming 38, 1987, 133–146.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Frantzeskakis, L.F., Powell, W.B. Restricted recourse strategies for bounding the expected network recourse function. Ann Oper Res 64, 261–287 (1996). https://doi.org/10.1007/BF02187649
Issue Date:
DOI: https://doi.org/10.1007/BF02187649