Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach

Mathematical Programming

Volumn 108, Issue 2-3, 2006, Pages 275-296

  Kong, Nan ^b   Schaefer, Andrew J ^a   Hunsaker, Brady ^a  

^a University of Pittsburgh   (United States)

^b University of South Florida   (United States)

Author keywords

Global Branch and Bound; Integer Programming; Level Sets; Stochastic Programming; Superadditive Duality

Indexed keywords

ALGORITHMS; FUNCTIONS; NUMERICAL METHODS; PROBLEM SOLVING; RANDOM PROCESSES; STOCHASTIC PROGRAMMING;

BRANCH-AND-BOUND APPROACH; GLOBAL BRANCH AND BOUND; LEVEL SETS; SUPERADDITIVE DUAL FORMULATION; SUPERADDITIVE DUALITY;

INTEGER PROGRAMMING;

EID: 33745698308     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-006-0711-y     Document Type: Article

References (50)

1. Ahmed, S., Tawarmalani, M., Sahinidis, N.V.: A finite branch-and-bound algorithm for two-stage stochastic integer programs. Mathematical Programming 100 (2), 355-377 (2004)
2. Alonso-Ayuso, A., Escudero, L.F., Garin, A., Ortuño, M.T., Pérez, G.: An approach for strategic supply chain planning under uncertainty based on stochastic 0-1 programming. Journal of Global Optimization 26(1), 97-124 (2003)
3. Alonso-Ayuso, A., Escudero, L.F., Ortuño, M.T.: BFC, a branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0-1 programs. European Journal of Operational Research 151 (3), 503-519 (2003)
4. Barahona, F., Bermon, S., Gunluk, O., Hood, S.: Robust capacity planning in semiconductor manufacturing. Optimization-Online Digest, Oct. 2001. http://www.optimization-onlme.org/ARCHIVE.DIGEST/2001-10.html
5. Blair, C.E., Jeroslow, R.G.: The value function of an integer program. Mathematical Programming 23, 237-273 (1982)
6. Buchberger, B.: Gröbner bases: An algorithmic method in polynomial ideal theory. In: Bose, N.K. (ed.) Multidimensional Systems Theory, Chapter 6. Reidel Publishing Company, Dordrecht, Holland, 1985, pp. 184-232
7. Burdet, C.A., Johnson, E.L.: A subadditive approach to solve linear integer programs. Annals of Discrete Mathematics 1, 117-144 (1977)
8. Carøe, C.C.: Decomposition in stochastic integer programming. PhD thesis, University of Copenhagen (1998)
9. Carøe, C.C., Schultz, R.: Dual decomposition in stochastic integer programming. Operations Research Letters 24 (1-2), 37-45 (1999)
10. Carøe C.C., Tind, J.: A cutting-plane approach to mixed 0-1 stochastic integer programs. European Journal of Operational Research 101 (2), 306-316 (1997)
11. Carøe, C.C., Tind, J.: L-shaped decomposition of two-stage stochastic programs with integer recourse. Mathematical Programming 83 (3), 451-464 (1998)
12. De Loera, J., Haws, D., Hemmecke, R., Huggins, P., Sturmfels, B. Yoshida, R.: Short rational functions for toric algebra and applications. Submitted to Journal of Symbolic Computation, 2004. http://front.math.ucdavis.edu/math.CO/ 0307350
13. Dye, S., Stougie, L., Tomasgard, A.: The stochastic single node service-provision problem. Naval Research Logistics 50 (8), 869-887 (2003)
14. Eriksson, N.: Toric ideals of homogeneous phylogenetic models. Proceedings of the 2004 International Symposium on Symbolic and Algebraic Computation, 2004. http://front.math.ucdavis.edu/math. CO/0401175
15. RANDOMRHS: Test Instances for Stochastic Integer Programming, http://www.engr.pitt.edu/hunsak-er/randomrhs/
16. Gilmore, P.C., Gomory, R.E.: The theory and computation of knapsack functions. Operations Research 14(6), 1045-1074 (1966)
17. Gomory, R.E.: Some polyhedra related to combinatorial problems. Linear Algebra and its Applications 2 (4), 451-558 (1969)
18. Graver, J.E.: On the foundation of linear integer programming I. Mathematical Programming 9, 207-226 (1975)
19. Hemmecke, R., Schultz, R.: Decomposition of test sets in stochastic integer programming. Mathematical Programming 94 (2-3), 323-341 (2003)
20. Horst, R., Tuy, H.: Global Optimization: Deterministic Approaches, 3rd edition. Springer-Verlag, Berlin, 1996
21. Johnson, E.L.: Cyclic groups, cutting planes and shortest paths. In: Hu, T.C., Robinson, S.M. (eds.) Mathematical Programming. Academic Press, New York, NY, 1973, pp. 185-211
22. Johnson, E.L.: Integer Programming: Facets, Subadditivity, and Duality for Group and Semi-Group Problems. SIAM Publications, Philadelphia, PA, 1980
23. Johnson, E.L.: Subadditive lifting methods for partitioning and knapsack problems. Journal of Algorithms 1, 75-96 (1980)
24. Johnson, E.L.: Characterization of facets for multiple right-hand choice linear programs. Mathematical Programming Study 14, 112-142 (1981)
25. th Integer Programming and Combinatorial Optimization Conference, Cambridge, MA, May, 2002, pp. 384-400
26. Klein Haneveld, W.K., Stougie, L., van der Vlerk, M.H.: Convex approximations for simple integer recourse models by perturbing the underlying distributions. Technical report, 97A19, SOM, University of Groningen, 1997
27. Klein Haneveld, W.K., van der Vlerk, M.H.: On the expected value of a simple integer recourse problem with random technology matrix. Journal of Computational and Applied Mathematics 56, 45-53 (1994)
28. Klein Haneveld, W.K., van der Vlerk, M.H.: Stochastic integer programming: general models and algorithms. Annals of Operations Research 85, 39-57 (1999)
29. Klein Haneveld, W.K., van der Vlerk, M.H., Stougie, L.: On the convex hull of the simple integer recourse objective function. Annals of Operations Research 56 (1-2), 209-224 (1995)
30. Klein Haneveld, W.K., van der Vlerk, M.H., Stougie, L.: An algorithm for the construction of convex hulls in simple integer recourse programming. Annals of Operations Research 64, 67-81 (1996)
31. Laporte, G., Louveaux, F.V.: The integer L-shaped method for stochastic integer programs with complete recourse. Operations Research Letters 13 (3), 133-142 (1993)
32. Llewellyn, D.C., Ryan, J.: A primal dual integer programming algorithm. Discrete Applied Mathematics 45 (3), 261-275 (1993)
33. Louveaux, F.V., van der Vlerk, M.H.: Stochastic programming with simple integer recourse. Mathematical Programming 61 (3), 301-325 (1993)
34. Mulvey, J.M., Ruszczyński, A.: A new scenario decomposition method for large-scale stochastic optimization. Operations Research 43 (3), 477-490 (1995)
35. Nemhauser, G.L.: Duality for integer optimization. In: O'hEigeartaigh, M., Lenstra, J.K., Rinnooy Kan, A.H.G. (eds.) Combinatorial Optimization: Annotated Bibliographies. Wiley, New York, NY, 1985, pp. 11-20
36. Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York, NY, 1988
37. Norkin, V.I., Ermoliev, Y.M., Ruszczyński, A.: On optimal allocation of indivisibles under uncertainty. Operations Research 46 (3), 381-395 (1998)
38. Nowak, M.P., Schultz, R., Westphalen, M.: Optimization of simultaneous power production and trading by stochastic integer programming. Stochastic Programming E-Print Series, 2002. http://www.speps.info
39. Schultz, R.: On structure and stability in stochastic programs with random technology matrix and complete integer recourse. Mathematical Programming 70 (1), 73-89 (1995)
40. Schultz, R.: Stochastic programming with integer variables. Mathematical Programming 97(1-2), 285-309 (2003)
41. Schultz, R., Stougie, L., van der Vlerk, M.H.: Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis reductions. Mathematical Programming 83 (2), 229-252 (1998)
42. 2 algorithm for large scale stochastic integer programming: Set convexification. Stochastic Programming E-Print Series, 2000. http://www.speps.info
43. Sen, S., Sherali, H.D.: Decomposition with branch-and-cut approaches for two stage stochastic mixed-integer programming. Submitted to Mathematical Programming, 2004. http://tucson.sie.arizona.edu/MORE/papers.html
44. Sherali, H.D., Fraticelli, B.M.P.: A modification of Benders' decomposition algorithm for discrete sub-problems: An approach for stochastic programs with integer recourse. Journal of Global Optimization 22 (1-4), 319-342 (2002)
45. Smith, J.C., Schaefer, A.J., Yen, J.W.: A stochastic integer programming approach to solving a synchronous optical network ring design problem. Networks 44 (1), 12-26 (2004)
46. Stougie, L.: Design and analysis of methods for stochastic integer programming. Technical report, CWI Tract 37, Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands, 1987
47. Thomas, R.R.: A geometric Buchberger algorithm for integer programming. Mathematics of Operations Research 20 (4), 864-884 (1995)
48. Van Slyke, R., Wets, R.J.-B.: L-shaped linear programs with applications to optimal control and stochastic programming. SIAM Journal on Applied Mathematics 17, 638-663 (1969)
49. Wollmer, R.D.: Two-stage linear programming under uncertainty with 0-1 integer first stage variables. Mathematical Programming 19 (3), 279-288 (1980)
50. Wolsey, L.A.: Integer programming duality: Price functions and sensitivity analysis. Mathematical Programming 20 (2), 173-195 (1981)