Abstract
We consider two-stage quadratic integer programs with stochastic right-hand sides, and present an equivalent reformulation using value functions. We propose a two-phase solution approach. The first phase constructs value functions of quadratic integer programs in both stages. The second phase solves the reformulation using a global branch-and-bound algorithm or a level-set approach. We derive some basic properties of value functions of quadratic integer programs and utilize them in our algorithms. We show that our approach can solve instances whose extensive forms are hundreds of orders of magnitude larger than the largest quadratic integer programming instances solved in the literature.
Similar content being viewed by others
References
Adams W.P., Forrester R.: Linear forms of nonlinear expressions: new insights on old ideas. Oper. Res. Lett. 35(4), 510–518 (2007)
Adams W.P., Sherali H.D.: A tight linearization and an algorithm for zero-one quadratic programming problems. Manag. Sci. 32(10), 1274–1290 (1986)
Adams W.P., Sherali H.D.: Mixed-integer bilinear programming problems. Math. Program. 59(1–3), 279–305 (1993)
Adams W.P., Forrester R., Glover F.: Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs. Discret. Optim. 1(2), 99–120 (2004)
Agrawal S.C.: On integer solutions to quadratic programs by a branch-and-bound technique. Trabajos de Estadìstica y de Investigaciòn Operativa 25(1–2), 65–70 (1974)
Agrawal S.C.: On mixed-integer quadratic programs. Naval Res. Logist. Q. 21(2), 289–297 (1974)
Agrawal S.C.: An alternative method on integer solutions to quadratic programs by a branch-and-bound technique. Trabajos de Estadìstica y de Investigaciòn Operativa 27(1–3), 185–192 (1976)
Ahmed S., Garcia R.: Dynamic capacity acquisition and assignment under uncertainty. Ann. Oper. Res. 124(1–4), 267–283 (2003)
Ahmed S., Tawarmalani M., Sahinidis N.V.: A finite branch and bound algorithm for two-stage stochastic integer programs. Math. Program. 100(2), 355–377 (2004)
Al-Khayyal F.A., Larsen C.: Global optimization of a quadratic function subject to a bounded mixed integer constraint set. Ann. Oper. Res. 25(1–4), 169–180 (1990)
Balas E.: Duality in discrete programming II: the quadratic case. Manag. Sci. 16(1), 14–32 (1969)
Bank B., Hansel R.: Stability of mixed-integer quadratic programming problems. Math. Program. Study 21, 1–17 (1984)
Blair C.E., Jeroslow R.G.: The value function of an integer program. Math. Program. 23(1), 237–273 (1982)
Bretthauer K.M., Shetty B.: The nonlinear resource allocation problem. Operations Research 43(4), 670–683 (1995)
Caprara A., Pisinger D., Toth P.: Exact solution of the quadratic knapsack problem. INFORMS J. Comput. 11(2), 125–137 (1999)
Carøe C.C., Tind J.: L-shaped decomposition of two-stage stochastic programs with integer recourse. Math. Program. 83(1–3), 451–464 (1998)
Cook W., Gerards A.M.H., Schrijver A., Tardos E.: Sensitivity results in integer linear programming. Math. Program. 34(3), 251–264 (1986)
Daniel J.W.: Stability of the solution of definite quadratic programs. Math. Program. 5(1), 41–53 (1973)
De Loera J.A., Haws D., Hemmecke R., Huggins P., Strumfels B., Yoshida R.: Short rational functions for toric algebra and applications. J. Symb. Comput. 38(2), 959–973 (2004)
Dua V., Papalexandri K.P., Pistikopoulos E.N.: Global optimization issues in multiparametric continuous and mixed-integer optimization problems. J. Glob. Optim. 30(1), 59–89 (2004)
Erenguc S.S., Benson H.P.: An algorithm for indefinite quadratic integer programming. INFORMS J. Comput. 11(2), 125–137 (1999)
Gallo G., Hammer P.L., Simeone B.: Quadratic knapsack problems. Math. Program. Study 12, 132–149 (1980)
Gilmore P.C., Gomory R.E.: The theory and computation of knapsack functions. Oper. Res. 14(6), 1045–1074 (1966)
Glover F.: Improved linear integer programming formulations of nonlinear integer problems. Manag. Sci. 22(4), 445–460 (1975)
Granot F., Skorin-Kapov J.: Some proximity and sensitivity results in quadratic integer programming. Math. Program. 47(2), 259–268 (1990)
Klein Haneveld W.K., van der Vlerk M.H.: Stochastic integer programming: general models and algorithms. Ann. Oper. Res. 85(1), 39–57 (1999)
Helmberg C., Rendl F.: Solving quadratic (0,1)-problems by semidefinite programs and cutting planes. Math. Program. 82(3), 291–315 (1998)
Helmberg C., Rendl F., Weismantel R.: A semidefinite programming approach to the quadratic knapsack problem. J. Comb. Optim. 4(2), 197–215 (2000)
Horst R., Tuy H.: Global Optimization: Deterministic Approaches, 3rd edn. Springer, Berlin (1996)
Huang H.-X., Pardalos P.M., Prokopyev O.A.: Lower bound improvement and forcing rule for quadratic binary programming. Comput. Optim. Appl. 33(2–3), 187–208 (2006)
Johnson E.L.: Integer Programming: Facets, Subadditivity, and Duality for Group and Semi-Group Problems. SIAM Publications, Philadelphia (1980)
Johnson E.L.: Subadditive lifting methods for partitioning and knapsack problems. J. Algorithms 1(1), 75–96 (1980)
Johnson E.L.: Characterization of facets for multiple right-hand choice linear programs. Math. Program. Study 14, 112–142 (1981)
Kalvenes J., Kennington J., Olinick E.V.: Base station location and service assignment in W-CDMA networks. INFORMS J. Comput. 18(3), 366–376 (2006)
Kong N., Schaefer A.J., Hunsaker B.: Two-stage integer programs with stochastic right-hand sides: a superadditive dual approach. Math. Program. 108(2), 275–296 (2006)
Lawler E.L.: The quadratic assignment problem. Manag. Sci. 9(4), 586–599 (1963)
Lazimy R.: Mixed-integer quadratic programming. Math. Program. 22(1), 332–349 (1982)
Lazimy R.: Improved algorithm for mixed-integer quadratic programs and a computational study. Math. Program. 32(1), 110–113 (1985)
Mao J.C.T., Wallingford B.A.: An extension of Lawler and Bell’s method of discrete optimization with examples from capital budgeting. Manag. Sci. 15(2), 851–860 (1969)
McBride R.D., Yormark J.S.: An implicit enumeration algorithm for quadratic integer programming. Manag. Sci. 26(3), 282–296 (1980)
McBride R.D., Yormark J.S.: Finding all solutions for a class of parametric quadratic integer programming problems. Manag. Sci. 26(8), 784–795 (1980)
Nemhauser G.L., Wolsey L.A.: Integer and Combinatorial Optimization. Wiley, NewYork (1988)
Ntaimo L., Sen S.: The million-variable ‘march’ for stochastic combinatorial optimization. J. Glob. Optim. 32(3), 385–400 (2004)
Oral M., Kettani O.: A linearization procedure for quadratic and cubic mixed-integer problems. Oper. Res. 40(S1), 109–116 (1990)
Oral M., Kettani O.: Reformulating nonlinear combinatorial optimization problems for higher computational efficiency. Eur. J. Oper. Res. 58(2), 236–249 (1992)
Pardalos P.M., Rodgers G.P.: Computational aspects of a branch and bound algorithm for quadratic zero–one programming. Computing 45(2), 131–144 (1990)
Picard J.-C., Ratliff H.D.: A cut approach to a class of quadratic integer programming problems. Networks 10(4), 363–370 (1980)
Quadri D., Soutif E., Tolla P.: Exact solution method to solve large scale integer quadratic multidimensional knapsack problems. J. Comb. Optim. 17(2), 157–167 (2009)
Schultz R.: On structure and stability in stochastic programs with random technology matrix and complete integer recourse. Math. Program. 70(1), 73–89 (1995)
Schultz R.: Stochastic programming with integer variables. Math. Program. 97(1–2), 285–309 (2003)
Schultz R., Stougie L., van der Vlerk M.H.: Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis reductions. Math. Program. 83(1–3), 229–252 (1998)
Smith J.C., Schaefer A., Yen J.W.: A stochastic integer programming approach to solving a synchronous optical network ring design problem. Networks 44(1), 12–26 (2004)
Snyder L.V., Daskin M.S., Teo C.-P.: The stochastic location model with risk pooling. Eur. J. Oper. Res. 179(3), 1221–1238 (2007)
SQIPRANDOMRHS. Test instances for two-stage stochastic quadratic integer programming. Available from http://www.engr.pitt.edu/industrial/faculty-staff/prokopyev/downloads/sqiprandomrhs/index.html (2010). Accessed 05 May 2010
Stougie, L.: Design and analysis of algorithms for stochastic integer programming, 1987. Ph.D. dissertation, Center for Mathematics and Computer Science, Amsterdam
Thoai N.V.: Global optimization techniques for solving the general quadratic integer programming problem. Comput. Optim. Appl. 10(2), 149–163 (1998)
Watters L.G.: Reduction of integer polynomial problems to zero-one linear programming problems. Oper. Res. 15(6), 1171–1174 (1967)
Wets R.J.-B.: Stochastic programs with fixed recourse: the equivalent deterministic problem. SIAM Rev. 16, 309–339 (1974)
Wolsey L.A.: Integer programming duality: price functions and sensitivity analysis. Math. Program. 20(2), 173–195 (1981)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Özaltın, O.Y., Prokopyev, O.A. & Schaefer, A.J. Two-stage quadratic integer programs with stochastic right-hand sides. Math. Program. 133, 121–158 (2012). https://doi.org/10.1007/s10107-010-0412-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-010-0412-4