Cited By
View all- Sherali HFraticelli B(2002)A modification of Benders' decomposition algorithm for discrete subproblemsJournal of Global Optimization10.1023/A:101382773121822:1-4(319-342)Online publication date: 1-Jan-2002
Conditional Stochastic Decomposition: An Algorithmic Interface for Optimization and Simulation
Pages 311 - 322
Abstract
<P>Simulation and optimization are among the most commonly used elements in the OR toolkit. Often times, some of the data elements used to define an optimization problem are best described by random variables, yielding a stochastic program. If the distributions of the random variables cannot be specified precisely, one may have to resort to simulation to obtain observations of these random variables. In this paper, we present conditional stochastic decomposition CSD, a method that may be construed as providing an algorithmic interface between simulation and optimization for the solution of stochastic linear programs with recourse. Derived from the concept of the stochastic decomposition of such problems, CSD uses randomly generated observations with a Renders decomposition of the problem. In this paper, our method is analytically verified and graphically illustrated. In addition, CSD is used to solve several test problems that have appeared in the literature. Our computational experience suggests that CSD may be particularly well suited for situations in which randomly generated observations are difficult to obtain.</P>
References
[1]
BIRGE, J. R. 1985. Decomposition and Partitioning Methods for Multistage Stochastic Linear Programs. Opns. Res. 33, 989-1007.
[2]
BIRGE, J. R., AND F. LOUVEAUX. 1988. A Multi-Cut Algorithm for Two Stage Linear Programs. Eur. J. Opnl. Res. 34, 384-392.
[3]
DANTZIG, G. B., AND P. GLYNN. 1990. Parallel Processors for Planning Under Uncertainty. Ann. Opns. Res. 22, 1-22.
[4]
EFRON, B. 1979. Bootstrap Methods: Another Look at the Jackknife. Ann. Statis. 7, 1-26.
[5]
ERMOLIEV, Y. 1983. Stochastic Quasigradient Methods and Their Application to System Optimization. Stochastics 9, 1-36.
[6]
FRAUENDORFER, K. 1988. Solving SLP Recourse Problems With Arbitrary Multivariate Distributions-- The Dependent Case. Math. Opns. Res. 13, 377-394.
[7]
GAIVORONSKY, A. 1988. Implementation of Stochastic Quasigradient Methods. In Numerical Techniques for Stochastic Optimization, Y. Ermoliev and R. Wets (eds.). Springer-Verlag, Berlin, 313-351.
[8]
GARTSKA, S., AND D. RUTHENBERG. 1973. Computation in Discrete Stochastic Programs With Recourse. Opns. Res. 21, 112-122.
[9]
HAUGLAND, D., AND S. W. WALLACE. 1988. Solving Many Linear Programs That Differ Only in the Righthand Side. Eur. J. Opnl. Res. 37, 318-324.
[10]
HIGLE, J. L., AND S. SEN. 1991a. Stochastic Decomposition: An Algorithm for Two Stage Linear Programs With Recourse. Math. Opns. Res. 16, 650-669.
[11]
HIGLE, J. L., AND S. SEN. 1991b. Statistical Verification of Optimality Conditions. Ann. Opns. Res. 30, 215-240.
[12]
HIGLE, J. L., AND S. SEN. 1992. On the Convergence of Algorithms, With Implications for Stochastic and Nondifferentiable Optimization. Math. Opns. Res. 17, 112-131.
[13]
HIGLE, J. L., AND S. SEN. 1993. Finite Master Programs in Regularized Stochastic Decomposition. Math. Prog. (to appear).
[14]
Ho, J. K., AND E. LOUTE. 1981. A Set of Staircase Linear Programming Test Problems. Math. Prog. 20, 245-250.
[15]
INFANGER, G. 1992. Monte Carlo (Importance) Sampling Within a Benders' Decomposition for Stochastic Linear Programs. Technical Report SOL 89-13, Department of Operations Research, Stanford University, Stanford, Calif.
[16]
KIEFER, J., AND J. WOLFOWITZ. 1952. Stochastic Estimation of the Maximum of a Regression Function. Ann. Math. Stat. 23, 462-466.
[17]
LOUVEAUX, F. V., AND Y. SMEERS. 1988. Optimal Investments for Electricity Generation: A Stochastic Model and Test Problem. In Numerical Techniques for Stochastic Optimization, Y. Ermoliev and R. J-B. Wets (eds.). Springer Verlag, Berlin, 445-454.
[18]
MULVEY, J. M., AND A. RUSZCZYNSKI. 1992. A New Scenario Decomposition Method for Large Scale Stochastic Optimization. Technical Report SOR-91-19, Department of Civil Engineering and Operations Research, Princeton University, Princeton, N.J.
[19]
NAZARETH, J. L., AND R. J-B. WETS. 1986. Algorithms for Stochastic Programs: The Case of Nonstochastic Tenders. Math. Prog. Study 28, 1-28.
[20]
PFLUG, G. C. 1988. Stepsize Rules, Stopping Times, and Their Implementation in Stochastic Quasigradient Algorithms. In Numerical Techniques for Stochastic Optimization, Y. Ermoliev and R. J-B. Wets (eds.). Springer Verlag, Berlin.
[21]
ROBBINS, H., AND S. MONROE. 1951. On a Stochastic Approximation Technique. Ann. Math. Stat. 22, 400-407.
[22]
RUSZCZYNSKI, A. 1987. A Linearization Method for Nonsmooth Stochastic Programming Problems. Math. Opns. Res. 12, 32-49.
[23]
SEN, S., R. D. DOVERSPIKE AND S. COSARES. 1992. Network Planning With Random Demand. Bell Communications Research Technical Memo, TM-OPT-022142, Red Bank, N.J.
[24]
VAN SLYKE, R., AND R. J-B. WETS. 1969. L-Shaped Linear Programs With Application to Optimal Control and Stochastic Programming. SIAM J. Appl. Math. 17, 638-663.
[25]
WETS, R. J-B. 1974. Stochastic Programs With Fixed Recourse: The Equivalent Deterministic Program. SIAM Rev., 16 309-339.
[26]
WETS, R. J-B. 1988. Large Scale Linear Programming Techniques. In Numerical Techniques for Stochastic Optimization, Y. Ermoliev and R. J-B. Wets (eds.). Springer-Verlag, Berlin.
- Conditional Stochastic Decomposition: An Algorithmic Interface for Optimization and Simulation
Recommendations
Multistage Stochastic Decomposition: A Bridge between Stochastic Programming and Approximate Dynamic Programming
Multistate stochastic programs pose some of the more challenging optimization problems. Because such models can become rather intractable in general, it is important to design algorithms that can provide approximations which, in the long run, yield ...
Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse
We present a cutting plane algorithm for two-stage stochastic linear programs with recourse. Motivated by Benders' decomposition, our method uses randomly generated observations of random variables to construct statistical estimates of supports of the ...
Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Random Recourse
This paper introduces disjunctive decomposition for two-stage mixed 0-1 stochastic integer programs (SIPs) with random recourse. Disjunctive decomposition allows for cutting planes based on disjunctive programming to be generated for each scenario ...
Comments
Information & Contributors
Information
Published In
Publisher
INFORMS
Linthicum, MD, United States
Publication History
Published: 01 April 1994
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 30 Jan 2025
Other Metrics
Citations
Cited By
View all- Sherali HFraticelli B(2002)A modification of Benders' decomposition algorithm for discrete subproblemsJournal of Global Optimization10.1023/A:101382773121822:1-4(319-342)Online publication date: 1-Jan-2002