Disjunctive cuts for non-convex mixed integer quadratically constrained programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5035 LNCS, Issue , 2008, Pages 17-33

  Saxena, Anureet ^a   Bonami, Pierre ^b   Lee, Jon ^c  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b AIX MARSEILLE UNIV   (France)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AEROSPACE APPLICATIONS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; DYNAMIC PROGRAMMING; LINEAR PROGRAMMING; MATHEMATICAL PROGRAMMING; NONLINEAR PROGRAMMING; NUMERICAL METHODS; OPTIMIZATION; QUADRATIC PROGRAMMING; RELAXATION PROCESSES;

CONSTRAINED PROGRAMMING; CONVEX QUADRATIC CONSTRAINTS; CONVEX RELAXATIONS; DISJUNCTIVE PROGRAMMING; INTEGER VARIABLES; INTERNATIONAL CONFERENCES; LIFT-AND-PROJECT; MIXED INTEGERS; NEW METHODS; PAPER ADDRESSES; VALID INEQUALITIES;

INTEGER PROGRAMMING;

EID: 45749133535     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-68891-4_2     Document Type: Conference Paper

References (27)

1. Anstreicher, K.M.: Semidefinite Programming versus the Reformulation-Linearization Technique for Nonconvex Quadratically Constrained Quadratic Programming. Preprint. Optimization Online (May 2007)
2. Balas, E.: Disjunctive programming: properties of the convex hull of feasible points. Disc. Appl. Math. 89(1-3), 3-44 (1998)
3. Balas, E., Ceria, S., Cornuéjols, G.: A lift-and-project cutting plane algorithm for mixed 0-1 programs. Math. Program. 58, 295-324 (1993)
4. Balas, E., Saxena, A.: Optimizing over the split closure. MSRR# 674, Tepper School of Business, Carnegie Mellon Univ., Math. Program. A (to appear, 2005)
5. Bonami, P., Biegler, L.T., Conn, A.R., Cornuéjols, G., Grossmann, I.E., Laird, C.D., Lee, J., Lodi, A., Margot, F., Sawaya, N., Wächter, A.: An Algorithmic Framework for Convex Mixed-integer Nonlinear Programs. Discrete Optimization (in press)
6. Burer, S., Vandenbussche, D.: A finite branch-and-bound algorithm for noncon-vex quadratic programming via semidefinite relaxations. Math. Programming (to appear)
7. Cornuéjols, G.: Revival of the Gomory cuts in the 1990's. Annals of Operations Research 149(1), 63-66 (2007)
8. Fischetti, M., Lodi, A.: Optimizing over the first Chvatal closure. Mathematical Programming (to appear)
9. Fletcher, R., Leyffer, S.: User Manual for FilterSQP. Numerical Analysis Report NA/181, Dundee University (1998)
10. Jeroslow, R.G.: There cannot be any algorithm for integer programming with quadratic constraints. Operations Research 21(1), 221-224 (1973)
11. GLOBALLib, http://www.gamsworld.org/global/globallib/globalstat.htm
12. Lee, S., Grossmann, I.E.: A global optimization algorithm for nonconvex generalized disjunctive programming and applications to process systems. Computers and Chemical Engineering 25, 1675-1697 (2001)
13. Kim, S., Kojima, M.: Second order cone programming relaxation of nonconvex quadratic optimization problems. Optim. Methods and Software 15, 201-204 (2001)
14. McCormick, G.P.: Computability of global solutions to factorable nonconvex programs: Part I Convex underestimating problems. Math. Prog. 10, 147-175 (1976)
15. Nowak, I., Alperin, H., Vigerske, S.: LaGO - An object oriented library for solving MINLPs. In: Bliek, C, et al. (eds.) Global Optimization and Constraint Satisfaction, pp. 32-42. Springer, Berlin (2003)
16. Nowak, I.: Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming. Birkhauser, Basel (2005)
17. Vigerske, S.: http://projects.coin-or.org/LaGO
18. Saxena, A., Goyal, V., Lejeune, M.: MIP Reformulations of the Probabilistic Set Covering Problem (2007) Optmization Online (e-print), http://www.optimization-online.org/DB_HTML//02/1579.html
19. Sen, S.: Relaxations for probabilistically constrained programs with discrete random variables. Operations Research Letters 11(2), 81-86 (1992)
20. Sherali, H.D., Adams, W.P.: A reformulation-linearization technique for solving discrete and continuous nonconvex problems. Kluwer, Dordecht (1998)
21. Sherali, H.D., Fraticelli, B.M.P.: Enhancing RLT relaxations via a new class of semidefinite cuts. J. Global Optim. 22, 233-261 (2002)
22. Sturm, J.F.: Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Methods and Software 11-12, 625-653 (1999)
23. Tawarmalani, M., Sahinidis, N.V.: Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications. Kluwer Academic Publishers, Boston (2002)
24. Tawarmalani, M., Sahinidis, N.V.: Global optimization of mixed integer nonlinear programs: A theoretical and computational study. Math. Prog. 99(3), 563-591 (2004)
25. Vandenbussche, D., Nemhauser, G.L.: A polyhedral study of nonconvex quadratic programs with box constraints. Math. Prog. 102(3), 531-556 (2005)
26. Vandenbussche, D., Nemhauser, G.L.: A branch-and-cut algorithm for nonconvex quadratic programs with box constraints. Math. Prog. 102(3), 559-575 (2005)
27. Wächter, A., Biegler, L.T.: On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming. Math. Prog. 106(1), 25-57 (2006)