On interval-subgradient and no-good cuts

Operations Research Letters

Volumn 38, Issue 5, 2010, Pages 341-345

  D'Ambrosio, Claudia ^a   Frangioni, Antonio ^b   Liberti, Leo ^c   Lodi, Andrea ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b UNIVERSITY OF PISA   (Italy)

^c ÉCOLE POLYTECHNIQUE   (France)

Author keywords

Interval gradient subgradient cuts; No good cuts; Nondifferentiable functions

Indexed keywords

OPERATIONS RESEARCH;

CONTINUOUSLY DIFFERENTIABLE; INTERVAL-GRADIENT/SUBGRADIENT CUTS; NON-CONVEX CONSTRAINTS; NON-DIFFERENTIABLE; NON-DIFFERENTIABLE FUNCTIONS; SUBGRADIENT; VALID INEQUALITY;

OPERATIONS RESEARCH;

EID: 77956341177     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2010.05.010     Document Type: Article

References (28)

1. F.A. Al-Khayyal, and H.D. Sherali On finitely terminating branch-and-bound algorithms for some global optimization problems SIAM Journal on Optimization 10 2000 1049 1057
2. A. Atamturk, and V. Narayanan Conic mixed-integer rounding cuts Mathematical Programming 122 2010 1 20
3. E. Balas Disjunctive programming Annals of Discrete Mathematics 5 1979 3 51
4. E. Balas, and R. Jeroslow Canonical cuts on the unit hypercube SIAM Journal on Applied Mathematics 23 1972 61 69
5. P. Belotti, S. Cafieri, J. Lee, L. Liberti, On the convergence of feasibility based bounds tightening, in: U. Faigle (Ed.), Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Kln, Kln University, 2010.
6. P. Belotti, J. Lee, L. Liberti, F. Margot, and A. Wchter Branching and bounds tightening techniques for non-convex MINLP Optimization Methods and Software 24 4 2009 597 634
7. M.S. Boddy, and D.P. Johnson A new method for the global solution of large systems of continuous constraints Ch. Bliek, Ch. Jermann, A. Neumaier, Global Optimization and Constraint Satisfaction Lecture Notes in Computer Science vol. 2861 2003 Springer Berlin 142 156
8. M. Bruglieri, and L. Liberti Optimal running and planning of a biomass-based energy production process Energy Policy 36 2008 2430 2438
9. A. Caprara, M. Locatelli, Global optimization problems and domain reduction strategies, Mathematical Programming, in press (doi:10.1007/s10107- 008-0263-4 ).
10. S. Ceria, and J. Soares Convex programming for disjunctive convex optimization Mathematical Programming 86 1999 595 614
11. M.T. ezik, and G. Iyengar Cuts for mixed 01 conic programming Mathematical Programming 104 2005 179 202
12. F.H. Clarke Optimization and Nonsmooth Analysis Classics in Applied Mathematics vol. 5 1990 SIAM Philadelphia
13. G. Codato, and M. Fischetti Combinatorial Benders' cuts Operations Research 54 2006 756 766
14. A. Frangioni, and C. Gentile Perspective cuts for a class of convex 01 mixed integer programs Mathematical Programming 106 2006 225 236
15. A. Frangioni, and C. Gentile A Computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes Operations Research Letters 37 2009 206 210
16. F. Kln Karzan, G.L. Nemhauser, and M.W.P. Savelsbergh Information-based branching schemes for binary linear mixed-integer programs Mathematical Programming Computation 1 2009 249 293
17. H.-J. Kim, and J.N. Hooker Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach Annals of Operations Research 115 2002 95 124
18. L. Liberti Writing global optimization software L. Liberti, N. Maculan, Global Optimization: From Theory to Implementation 2006 Springer Berlin 211 262
19. L. Liberti, and C.C. Pantelides An exact reformulation algorithm for large nonconvex NLPs involving bilinear terms Journal of Global Optimization 36 2006 161 189
20. G. Nannicini, P. Belotti, Rounding-based heuristics for nonconvex minlps with binary variables, Technical Report, Working Paper, 2009.
21. I. Nowak Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming International Series of Numerical Mathematics 2005 Birkhuser Verlag
22. J.-Ph. Richard, and M. Tawarmalani Lifting inequalities: a framework for generating strong cuts for nonlinear programs Mathematical Programming 121 2010 61 104
23. R.T. Rockafellar Convex Analysis 1970 Princeton University Press Princeton, NJ
24. H. Schichl, and A. Neumaier Interval analysis on directed acyclic graphs for global optimization Journal of Global Optimization 33 4 2005 541 562
25. H. Sherali, and W. Adams A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions Discrete Applied Mathematics 157 2009 1319 1333
26. H. Sherali, and A. Alameddine A new reformulation-linearization technique for bilinear programming problems Journal of Global Optimization 2 1992 379 410
27. M. Tawarmalani, and N.V. Sahinidis Semidefinite relaxations of fractional programs via novel convexifications techniques Journal of Global Optimization 20 2001 137 158
28. M. Tawarmalani, and N.V. Sahinidis Global optimization of mixed-integer nonlinear programs: a theoretical and computational study Mathematical Programming 99 2004 563 591