Inexact cuts in Benders decomposition

SIAM Journal on Optimization

Volumn 10, Issue 3, 2000, Pages 643-657

  Zakeri, Golbon ^a   Philpott, Andrew B ^b   Ryan, David M ^b  

^a ARGONNE NATIONAL LABORATORY   (United States)

^b UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

Benders decomposition; Inexact cuts; Stochastic programming

Indexed keywords

EID: 0034399522     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623497318700     Document Type: Article

References (19)

1. K. T. AU, J. L. HIGLE, AND S. SEN, Inexact subgradient methods with applications in stochastic programming, Math. Programming, 63 (1994), pp. 65-82.
2. O. BAHN, O. DU MERLE, J.-L. GOFFIN, AND J.-P. VIAL, A cutting plane method from analytic centers for stochastic programming, Math. Programming Ser. B, 69 (1995), pp. 45-73.
3. J. F. BENDERS, Partitioning procedures for solving mixed-variables programming problems, Numer. Math., 4 (1962), pp. 238-252.
4. K. P. BROAD, Power Generation Planning Using Scenario Aggregation, M.S. thesis, University of Auckland, Auckland, New Zealand, 1996.
5. G. B. DANTZIG AND P. WOLFE, Decomposition principle for linear programs, Oper. Res., 8 (1960), pp. 101-111.
6. G. B. DANTZIG AND P. WOLFE, The decomposition algorithm for linear programs, Econometrica, 29 (1961), pp. 767-778.
7. E. FLIPPO AND A. RINNOOY KAN, Decomposition in general mathematical programming, Math. Programming, 60 (1993), pp. 361-382.
8. A. M. GEOFFRION, Generalized Benders decomposition, J. Optim. Theory Appl., 10 (1972), pp. 237-260.
9. J. GONDZIO, Warm start of the primal-dual method applied in the cutting-plane scheme, Math. Programming Ser. A, 83 (1998), pp. 125-143.
10. J. L. HIGLE AND S. SEN, On the convergence of algorithms with implications for stochastic and nondifferentiable optimization, Math. Oper. Res., 17 (1992), pp. 112-131.
11. W. HOGAN, Application of general convergence theory for outer approximation algorithms, Math. Programming, 5 (1973), pp. 151-168.
12. J. JACOBS, G. FREEMAN, J. GRYGIER, D. MORTON, G. SCHULTZ, K. STASCHUS, AND J. STEDINGER, SOCRATES: A system for scheduling hydro-electric generation under uncertainty, Ann. Oper. Res., 59 (1995), pp. 99-133.
13. P. KALL AND S. W. WALLACE, Stochastic Programming, John Wiley, New York, 1994.
14. J. E. KELLEY, JR., The cutting-plane method for convex programs, J. Soc. Indust. Appl. Math., 8 (1960), pp. 703-712.
15. K. KIM AND J. L. NAZARETH, The decomposition principle and algorithm for linear programming, Linear Algebra Appl., 152 (1991), pp. 119-133.
16. R. T. ROCKAFELLAR, Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
17. R. M. VAN SLYKE AND R. WETS, L-shaped linear programs with applications to optimal control and stochastic programming, SIAM J. Appl. Math., 17 (1969), pp. 638-663.
18. R. J. WITTROCK, Advances in a Nested Decomposition Algorithm for Solving Staircase Linear Programs, Report SOL 83-2, Systems Optimization Laboratory, Department of Operations Research, Stanford University, Stanford, CA, 1983.
19. G. ZAKERI, D. M. RYAN, AND A. B. PHILPOTT, Techniques for Solving Large Scale Set Partitioning Problems, Technical report, University of Auckland, New Zealand, 1996.