Cutting Planes and Elementary Closures for Non-linear Integer Programming
|
|
- Scott Cummings
- 6 years ago
- Views:
Transcription
1 Cutting Planes and Elementary Closures for Non-linear Integer Programming Juan Pablo Vielma University of Pittsburgh joint work with D. Dadush and S. S. Dey S. Modaresi and M. Kılınç Georgia Institute of Technology University of Pittsburgh NSF CMMI and ONR N DIMACS, November, 2011 Rutgers University, New Jersey
2 Cutting Planes for Integer Programming Valid Inequalities for the convex hull of integer feasible solutions. 50+ Years of development for Linear Integer Programming. Used to get tighter Linear Programming Relaxations. Crucial for state of the art solvers. 2/24
3 Convex Non-Linear Integer Programming Problems with convex continuous relaxation. Many applications, results and algorithms available. Cutting planes significantly less developed. Need new tools: linear results strongly rely on rationals. 3/24
4 Two Classic Cutting Planes Chvátal-Gomory Cuts (Gomory 68, Chvátal 73): AKA Gomory Fractional Cut Simple, but yield pure cutting plane algorithm, Blossom s for Matching and Comb s for TSP. Split Cuts (Cook, Kannan and Shrijver 1990): AKA MIG (Gomory 1960) and MIR (Nemhauser and Wolsey 1988) Yield Flow Cover Cuts and modern IP solvers. 4 /24
5 Outline Chvátal-Gomory Cuts for Non-Linear IP: Polyhedrality of the Chvátal-Gomory Closure Split Cuts for Non-Linear IP: Closed form Expressions. Finite Generation v/s Polyhedrality of Split Closure Other Results and Open Questions 5/24
6 6/24
7 CG Cuts and Support Function 7/24
8 CG Cuts and Support Function 7/24
9 CG Cuts and Support Function 7/24
10 CG Cuts and Support Function 7/24
11 CG Cuts and Support Function Valid for H Z n 7/24
12 CG Cuts and Support Function Valid for H Z n 7/24
13 CG Cuts and Support Function Valid for H Z n Valid for C Z n CG Cut 7/24
14 CG Cuts and Support Function Valid for H Z n Valid for C Z n CG Cut 7/24
15 CG Closure = Add all CG Cuts 8/24
16 CG Closure = Add all CG Cuts Polyhedral? 8/24
17 CG Closure = Add all CG Cuts Polyhedral? C = a Z n {x R n : a, x σ C (a)} 8/24
18 CG Closure = Add all CG Cuts Polyhedral? C = a Z n {x R n : a, x σ C (a)} 8/24
19 Polyhedrality of CG Closure Not always a polyhedron 9/24
20 Polyhedrality of CG Closure Not always a polyhedron Shrijver 1980: Theorem: If C is a rational polyhedron then is too. (Constructive Proof) 9/24
21 Polyhedrality of CG Closure Not always a polyhedron Shrijver 1980: Theorem: If C is a rational polyhedron then is too. (Constructive Proof) Question: What about for non-rational polytopes? 9/24
22 CG Closure is Finitely Generated Theorem (Dadush, Dey, V. 2011): If C is a compact convex set then there exists a finite such that: Corollary: is a rational polytope. In particular answers Shrijver s question. Also answered by Dunkel and Schulz /24
23 Corollary: Stability of CG Closure 11/24
24 Corollary: Stability of CG Closure 11/24
25 Proof Sketch of Theorem For strictly convex sets without integral points in boundary Proof Outline: Step 1: Create finite s.t.. Separate points in boundary Compactness argument Step 2: Show only missed finite number of cuts 12/24
26 Separate points in /24
27 Separate points in /24
28 Separate points in /24
29 Separate points in /24
30 Separate points in 13/24
31 Separate points in 13/24
32 Separate points in 13/24
33 Separate points in 13/24
34 Compactness Argument K := bd(c) S u := {x : a u,x > σ C (a u )} /24
35 Compactness Argument K := bd(c) S u := {x : a u,x > σ C (a u )} /24
36 Compactness Argument K := bd(c) S u := {x : a u,x > σ C (a u )} compact /24
37 Compactness Argument K := bd(c) S u := {x : a u,x > σ C (a u )} compact /24
38 Compactness Argument K := bd(c) S u := {x : a u,x > σ C (a u )} compact S 1 = m i=1 a ui /24
39 Step 2 : Separate /24
40 Step 2 : Separate 3 ε > 0 εb n + v C v V /24
41 Step 2 : Separate 3 ε > 0 εb n + v C v V a 1 ε 2 σ C (a) σ C (a) 1 σ v+εb n(a) 1 = v, a + εa 1 v, a /24
42 Step 2 : Separate 3 ε > 0 εb n + v C v V a 1 ε 2 σ C (a) σ C (a) 1 σ v+εb n(a) 1 = v, a + εa 1 v, a S 2 =(1/ε)B Z n /24
43 Main Tool: Lifting Cuts for Faces Part 1: Kill Irrationality: Kronecker s approx. Part 2: Lift inside Dirichlet s approx. 16/24
44 Main Tool: Lifting Cuts for Faces Part 1: Kill Irrationality: Kronecker s approx. Part 2: Lift inside Dirichlet s approx. 16/24
45 Main Tool: Lifting Cuts for Faces Part 1: Kill Irrationality: Kronecker s approx. Part 2: Lift inside Dirichlet s approx. 16/24
46 Main Tool: Lifting Cuts for Faces Part 1: Kill Irrationality: Kronecker s approx. Part 2: Lift inside Dirichlet s approx. 16/24
47 Split Cuts 17/24
48 Split Cuts Split Disjunctions and Split Cuts 18/24
49 Split Cuts Split Disjunctions and Split Cuts 18/24
50 Split Cuts Split Disjunctions and Split Cuts Split Disjunction 18/24
51 Split Cuts Split Disjunctions and Split Cuts Split Disjunction 18/24
52 Split Cuts Split Disjunctions and Split Cuts Split Disjunction 18/24
53 Split Cuts Split Disjunctions and Split Cuts Split Disjunction 18/24
54 Split Cuts Split Disjunctions and Split Cuts Split Disjunction 18/24
55 Split Cuts Split Disjunctions and Split Cuts Split Disjunction 18/24
56 Split Cuts Split Disjunctions and Split Cuts Split Disjunction Split Cuts 18/24
57 Split Cuts Known Facts for Rational Polyhedra Formulas for simplicial cones: MIG (Gomory 1960) and MIR (Nemhauser and Wolsey 1988) 19/24
58 Split Cuts Known Facts for Rational Polyhedra Formulas for simplicial cones: MIG (Gomory 1960) and MIR (Nemhauser and Wolsey 1988) Split Closure : Rational Polyhedron (Cook, Kannan and Shrijver 1990) Constructive Proofs: Dash, Günlük and Lodi 2007; V /24
59 Split Cuts Split Cut for Ellipsoids Dadush, Dey and V. 2011: Also see Belotti, Góez, Polik, Ralphs, Terlaky /24
60 Split Cuts Split Cut for Quadratic Cones Modaresi, Kılınç, V. 2011: 21/24
61 Split Cuts Split Closure is Finitely Generated Theorem (Dadush, Dey, V. 2011): If C is a strictly convex set then there exists a finite such that: Does not imply polyhedrality of split closure. Split Closure is not stable 22/24
62 Split Cuts Split Closure Can Be Non-Polyhedral 23/24
63 Split Cuts Split Closure Can Be Non-Polyhedral 23/24
64 Split Cuts Split Closure Can Be Non-Polyhedral 23/24
65 Split Cuts Split Closure Can Be Non-Polyhedral 23/24
66 Other Results and Open Questions CG closure is polyhedron for a class of unbounded sets: Class includes rational polyhedra = True generalization of Schrijver theorem. Open Questions: Constructive characterization of CG closure. Algorithms to separate CG/Split cuts. 24/24
Split Cuts for Convex Nonlinear Mixed Integer Programming
Split Cuts for Convex Nonlinear Mixed Integer Programming Juan Pablo Vielma University of Pittsburgh joint work with D. Dadush and S. S. Dey S. Modaresi and M. Kılınç Georgia Institute of Technology University
More informationSplit Cuts for Convex Nonlinear Mixed Integer Programming
Split Cuts for Convex Nonlinear Mixed Integer Programming Juan Pablo Vielma Massachusetts Institute of Technology joint work with D. Dadush and S. S. Dey S. Modaresi and M. Kılınç Georgia Institute of
More informationThe Split Closure of a Strictly Convex Body
The Split Closure of a Strictly Convex Body D. Dadush a, S. S. Dey a, J. P. Vielma b,c, a H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, 765 Ferst Drive
More informationThe Split Closure of a Strictly Convex Body
The Split Closure of a Strictly Convex Body D. Dadush a, S. S. Dey a, J. P. Vielma b,c, a H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, 765 Ferst Drive
More informationSplit cuts and extended formulations for Mixed Integer Conic Quadratic Programming
Split cuts and extended formulations for Mixed Integer Conic Quadratic Programming The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters.
More informationA Constructive Characterization of the Split Closure of a Mixed Integer Linear Program. Juan Pablo Vielma
A Constructive Characterization of the Split Closure of a Mixed Integer Linear Program Juan Pablo Vielma June 26, 2006 Review: MIP and Relaxation We study the MIP feasible region P I := {x P R n : x j
More informationSome cut-generating functions for second-order conic sets
Some cut-generating functions for second-order conic sets Asteroide Santana 1 and Santanu S. Dey 1 1 School of Industrial and Systems Engineering, Georgia Institute of Technology June 1, 2016 Abstract
More informationThe Chvátal-Gomory Closure of an Ellipsoid is a Polyhedron
The Chvátal-Gomory Closure of an Ellipsoid is a Polyhedron Santanu S. Dey 1 and Juan Pablo Vielma 2,3 1 H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology,
More informationDisjunctive Cuts for Cross-Sections of the Second-Order Cone
Disjunctive Cuts for Cross-Sections of the Second-Order Cone Sercan Yıldız Gérard Cornuéjols June 10, 2014 Abstract In this paper we provide a unified treatment of general two-term disjunctions on crosssections
More informationOn the Chvátal-Gomory Closure of a Compact Convex Set
On the Chvátal-Gomory Closure of a Compact Convex Set Daniel Dadush 1, Santanu S. Dey 1, and Juan Pablo Vielma 2 1 H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology,
More informationIntersection cuts for nonlinear integer programming: convexification techniques for structured sets
Noname manuscript No. (will be inserted by the editor Intersection cuts for nonlinear integer programming: convexification techniques for structured sets Sina Modaresi Mustafa R. Kılınç Juan Pablo Vielma
More informationIntersection cuts for nonlinear integer programming: convexification techniques for structured sets
Noname manuscript No. (will be inserted by the editor) Intersection cuts for nonlinear integer programming: convexification techniques for structured sets Sina Modaresi Mustafa R. Kılınç Juan Pablo Vielma
More informationMinimal Valid Inequalities for Integer Constraints
Minimal Valid Inequalities for Integer Constraints Valentin Borozan LIF, Faculté des Sciences de Luminy, Université de Marseille, France borozan.valentin@gmail.com and Gérard Cornuéjols Tepper School of
More informationLattice closures of polyhedra
Lattice closures of polyhedra Sanjeeb Dash IBM Research sanjeebd@us.ibm.com Oktay Günlük IBM Research gunluk@us.ibm.com April 10, 2017 Diego A. Morán R. Universidad Adolfo Ibañez diego.moran@uai.cl Abstract
More informationA Note on the MIR closure
A Note on the MIR closure Pierre Bonami Tepper School of Business, Carnegie Mellon University, Pittsburgh PA 53, USA. Gérard Cornuéjols Tepper School of Business, Carnegie Mellon University, Pittsburgh
More informationPolyhedral Approach to Integer Linear Programming. Tepper School of Business Carnegie Mellon University, Pittsburgh
Polyhedral Approach to Integer Linear Programming Gérard Cornuéjols Tepper School of Business Carnegie Mellon University, Pittsburgh 1 / 30 Brief history First Algorithms Polynomial Algorithms Solving
More informationconstraints Ax+Gy» b (thus any valid inequalityforp is of the form u(ax+gy)» ub for u 2 R m + ). In [13], Gomory introduced a family of valid inequali
On the Rank of Mixed 0,1 Polyhedra Λ Gérard Cornuéjols Yanjun Li Graduate School of Industrial Administration Carnegie Mellon University, Pittsburgh, USA (corresponding author: gc0v@andrew.cmu.edu) February
More informationLattice closures of polyhedra
Lattice closures of polyhedra Sanjeeb Dash IBM Research sanjeebd@us.ibm.com Oktay Günlük IBM Research gunluk@us.ibm.com October 27, 2016 Diego A. Morán R. Universidad Adolfo Ibañez diego.moran@uai.cl Abstract
More informationOn the Relative Strength of Split, Triangle and Quadrilateral Cuts
On the Relative Strength of Split, Triangle and Quadrilateral Cuts Amitabh Basu Pierre Bonami Gérard Cornuéjols François Margot Abstract Integer programs defined by two equations with two free integer
More informationConvex hull of two quadratic or a conic quadratic and a quadratic inequality
Noname manuscript No. (will be inserted by the editor) Convex hull of two quadratic or a conic quadratic and a quadratic inequality Sina Modaresi Juan Pablo Vielma the date of receipt and acceptance should
More informationAsteroide Santana, Santanu S. Dey. December 4, School of Industrial and Systems Engineering, Georgia Institute of Technology
for Some for Asteroide Santana, Santanu S. Dey School of Industrial Systems Engineering, Georgia Institute of Technology December 4, 2016 1 / 38 1 1.1 Conic integer programs for Conic integer programs
More informationMulti-Row Cuts in Integer Programming. Tepper School of Business Carnegie Mellon University, Pittsburgh
Multi-Row Cuts in Integer Programming Gérard Cornuéjols Tepper School o Business Carnegie Mellon University, Pittsburgh March 2011 Mixed Integer Linear Programming min s.t. cx Ax = b x j Z or j = 1,...,
More informationCutting planes from extended LP formulations
Cutting planes from extended LP formulations Merve Bodur University of Wisconsin-Madison mbodur@wisc.edu Sanjeeb Dash IBM Research sanjeebd@us.ibm.com March 7, 2016 Oktay Günlük IBM Research gunluk@us.ibm.com
More informationStructure in Mixed Integer Conic Optimization: From Minimal Inequalities to Conic Disjunctive Cuts
Structure in Mixed Integer Conic Optimization: From Minimal Inequalities to Conic Disjunctive Cuts Fatma Kılınç-Karzan Tepper School of Business Carnegie Mellon University Joint work with Sercan Yıldız
More informationOn mixed-integer sets with two integer variables
On mixed-integer sets with two integer variables Sanjeeb Dash IBM Research sanjeebd@us.ibm.com Santanu S. Dey Georgia Inst. Tech. santanu.dey@isye.gatech.edu September 8, 2010 Oktay Günlük IBM Research
More informationLecture 2. Split Inequalities and Gomory Mixed Integer Cuts. Tepper School of Business Carnegie Mellon University, Pittsburgh
Lecture 2 Split Inequalities and Gomory Mixed Integer Cuts Gérard Cornuéjols Tepper School of Business Carnegie Mellon University, Pittsburgh Mixed Integer Cuts Gomory 1963 Consider a single constraint
More informationInteger Programming ISE 418. Lecture 13. Dr. Ted Ralphs
Integer Programming ISE 418 Lecture 13 Dr. Ted Ralphs ISE 418 Lecture 13 1 Reading for This Lecture Nemhauser and Wolsey Sections II.1.1-II.1.3, II.1.6 Wolsey Chapter 8 CCZ Chapters 5 and 6 Valid Inequalities
More informationKey words. Integer nonlinear programming, Cutting planes, Maximal lattice-free convex sets
ON MAXIMAL S-FREE CONVEX SETS DIEGO A. MORÁN R. AND SANTANU S. DEY Abstract. Let S Z n satisfy the property that conv(s) Z n = S. Then a convex set K is called an S-free convex set if int(k) S =. A maximal
More informationA Lower Bound on the Split Rank of Intersection Cuts
A Lower Bound on the Split Rank of Intersection Cuts Santanu S. Dey H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology. 200 Outline Introduction: split rank,
More informationOn the Relative Strength of Split, Triangle and Quadrilateral Cuts
On the Relative Strength of Split, Triangle and Quadrilateral Cuts Amitabh Basu Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA 53 abasu@andrew.cmu.edu Pierre Bonami LIF, Faculté
More informationVALID INEQUALITIES AND REFORMULATION TECHNIQUES FOR MIXED INTEGER NONLINEAR PROGRAMMING
VALID INEQUALITIES AND REFORMULATION TECHNIQUES FOR MIXED INTEGER NONLINEAR PROGRAMMING by Sina Modaresi B.S., Sharif University of Technology, 2010 M.S., University of Pittsburgh, 2012 Submitted to the
More informationStructure of Valid Inequalities for Mixed Integer Conic Programs
Structure of Valid Inequalities for Mixed Integer Conic Programs Fatma Kılınç-Karzan Tepper School of Business Carnegie Mellon University 18 th Combinatorial Optimization Workshop Aussois, France January
More informationLP Relaxations of Mixed Integer Programs
LP Relaxations of Mixed Integer Programs John E. Mitchell Department of Mathematical Sciences RPI, Troy, NY 12180 USA February 2015 Mitchell LP Relaxations 1 / 29 LP Relaxations LP relaxations We want
More informationOn the Relative Strength of Split, Triangle and Quadrilateral Cuts
On the Relative Strength of Split, Triangle and Quadrilateral Cuts Amitabh Basu Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA 53 abasu@andrew.cmu.edu Pierre Bonami LIF, Faculté
More informationSome Relationships between Disjunctive Cuts and Cuts based on S-free Convex Sets
Some Relationships between Disjunctive Cuts and Cuts based on S-free Convex Sets Sanjeeb Dash a Santanu S. Dey b Oktay Günlük a a Business Analytics and Mathematical Sciences Department, IBM T. J. Watson
More informationOn Sublinear Inequalities for Mixed Integer Conic Programs
Noname manuscript No. (will be inserted by the editor) On Sublinear Inequalities for Mixed Integer Conic Programs Fatma Kılınç-Karzan Daniel E. Steffy Submitted: December 2014; Revised: July 7, 2015 Abstract
More informationLOWER BOUNDS FOR CHVÁTAL-GOMORY STYLE OPERATORS SEBASTIAN POKUTTA
LOWER BOUNDS FOR CHVÁTAL-GOMORY STYLE OPERATORS SEBASTIAN POKUTTA Friedrich-Alexander-University of Erlangen-Nürnberg Am Weichselgarten 9 91058 Erlangen Germany ABSTRACT. Valid inequalities or cutting
More informationMixed-integer nonlinear programming, Conic programming, Duality, Cutting
A STRONG DUAL FOR CONIC MIXED-INTEGER PROGRAMS DIEGO A. MORÁN R., SANTANU S. DEY, AND JUAN PABLO VIELMA Abstract. Mixed-integer conic programming is a generalization of mixed-integer linear programming.
More informationStrong Dual for Conic Mixed-Integer Programs
Strong Dual for Conic Mixed-Integer Programs Diego A. Morán R. Santanu S. Dey Juan Pablo Vielma July 14, 011 Abstract Mixed-integer conic programming is a generalization of mixed-integer linear programming.
More informationOn the Rational Polytopes with Chvátal Rank 1
On the Rational Polytopes with Chvátal Rank 1 Gérard Cornuéjols Dabeen Lee Yanjun Li December 2016, revised May 2018 Abstract We study the following problem: given a rational polytope with Chvátal rank
More informationLift-and-Project Inequalities
Lift-and-Project Inequalities Q. Louveaux Abstract The lift-and-project technique is a systematic way to generate valid inequalities for a mixed binary program. The technique is interesting both on the
More informationDeciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point
Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point Gérard Cornuéjols 1 and Yanjun Li 2 1 Tepper School of Business, Carnegie Mellon
More informationBCOL RESEARCH REPORT 07.04
BCOL RESEARCH REPORT 07.04 Industrial Engineering & Operations Research University of California, Berkeley, CA 94720-1777 LIFTING FOR CONIC MIXED-INTEGER PROGRAMMING ALPER ATAMTÜRK AND VISHNU NARAYANAN
More informationOn the separation of split cuts and related inequalities
Math. Program., Ser. B 94: 279 294 (2003) Digital Object Identifier (DOI) 10.1007/s10107-002-0320-3 Alberto Caprara Adam N. Letchford On the separation of split cuts and related inequalities Received:
More informationMinimal inequalities for an infinite relaxation of integer programs
Minimal inequalities for an infinite relaxation of integer programs Amitabh Basu Carnegie Mellon University, abasu1@andrew.cmu.edu Michele Conforti Università di Padova, conforti@math.unipd.it Gérard Cornuéjols
More informationComputational Experiments with Cross and Crooked Cross Cuts
Submitted to INFORMS Journal on Computing manuscript (Please, provide the mansucript number!) Authors are encouraged to submit new papers to INFORMS journals by means of a style file template, which includes
More informationCutting Plane Methods I
6.859/15.083 Integer Programming and Combinatorial Optimization Fall 2009 Cutting Planes Consider max{wx : Ax b, x integer}. Cutting Plane Methods I Establishing the optimality of a solution is equivalent
More informationInteger Programming ISE 418. Lecture 13b. Dr. Ted Ralphs
Integer Programming ISE 418 Lecture 13b Dr. Ted Ralphs ISE 418 Lecture 13b 1 Reading for This Lecture Nemhauser and Wolsey Sections II.1.1-II.1.3, II.1.6 Wolsey Chapter 8 CCZ Chapters 5 and 6 Valid Inequalities
More information1 Solution of a Large-Scale Traveling-Salesman Problem... 7 George B. Dantzig, Delbert R. Fulkerson, and Selmer M. Johnson
Part I The Early Years 1 Solution of a Large-Scale Traveling-Salesman Problem............ 7 George B. Dantzig, Delbert R. Fulkerson, and Selmer M. Johnson 2 The Hungarian Method for the Assignment Problem..............
More informationCutting Planes for Mixed-Integer Programming: Theory and Practice
Cutting Planes for Mixed-Integer Programming: Theory and Practice Oktay Günlük Math Sciences, IBM Research April 2018 ORF523, Princeton Mathematical optimization 1 A generic mathematical optimization problem:
More informationChange in the State of the Art of (Mixed) Integer Programming
Change in the State of the Art of (Mixed) Integer Programming 1977 Vancouver Advanced Research Institute 24 papers 16 reports 1 paper computational, 4 small instances Report on computational aspects: only
More informationCarnegie Mellon University, Pittsburgh, USA. April Abstract
Elementary Closures for Integer Programs Gerard Cornuejols Yanjun Li Graduate School of Industrial Administration Carnegie Mellon University, Pittsburgh, USA April 2000 (revised October 2000) Abstract
More informationMIR Closures of Polyhedral Sets
MIR Closures of Polyhedral Sets Sanjeeb Dash IBM Research Oktay Günlük IBM Research Andrea Lodi Univ. Bologna February 28, 2007 Abstract We study the mixed-integer rounding (MIR) closures of polyhedral
More informationLifting for conic mixed-integer programming
Math. Program., Ser. A DOI 1.17/s117-9-282-9 FULL LENGTH PAPER Lifting for conic mixed-integer programming Alper Atamtürk Vishnu Narayanan Received: 13 March 28 / Accepted: 28 January 29 The Author(s)
More informationWhen the Gomory-Chvátal Closure Coincides with the Integer Hull
Date for Revised Manuscript: December 19, 2017 When the Gomory-Chvátal Closure Coincides with the Integer Hull Gérard Cornuéjols Yanjun Li Abstract Gomory-Chvátal cuts are prominent in integer programming.
More informationThe Strength of Multi-row Aggregation Cuts for Sign-pattern Integer Programs
The Strength of Multi-row Aggregation Cuts for Sign-pattern Integer Programs Santanu S. Dey 1, Andres Iroume 1, and Guanyi Wang 1 1 School of Industrial and Systems Engineering, Georgia Institute of Technology
More informationProjected Chvátal-Gomory cuts for Mixed Integer Linear Programs. Pierre Bonami CMU, USA. Gerard Cornuéjols CMU, USA and LIF Marseille, France
Projected Chvátal-Gomory cuts for Mixed Integer Linear Programs Pierre Bonami CMU, USA Gerard Cornuéjols CMU, USA and LIF Marseille, France Sanjeeb Dash IBM T.J. Watson, USA Matteo Fischetti University
More informationTwo-Term Disjunctions on the Second-Order Cone
Noname manuscript No. (will be inserted by the editor) Two-Term Disjunctions on the Second-Order Cone Fatma Kılınç-Karzan Sercan Yıldız the date of receipt and acceptance should be inserted later Abstract
More informationSplit closure and intersection cuts
Math. Program., Ser. A 102: 457 493 (2005) Digital Object Identifier (DOI) 10.1007/s10107-004-0558-z Kent Andersen Gérard Cornuéjols Yanjun Li Split closure and intersection cuts Received: February 4,
More informationHow tight is the corner relaxation? Insights gained from the stable set problem
How tight is the corner relaxation? Insights gained from the stable set problem Gérard Cornuéjols a,1, Carla Michini b,,, Giacomo Nannicini c,3 a Tepper School of Business, Carnegie Mellon University,
More informationInteger Programming ISE 418. Lecture 12. Dr. Ted Ralphs
Integer Programming ISE 418 Lecture 12 Dr. Ted Ralphs ISE 418 Lecture 12 1 Reading for This Lecture Nemhauser and Wolsey Sections II.2.1 Wolsey Chapter 9 ISE 418 Lecture 12 2 Generating Stronger Valid
More informationDisjunctive conic cuts: The good, the bad, and implementation
Disjunctive conic cuts: The good, the bad, and implementation MOSEK workshop on Mixed-integer conic optimization Julio C. Góez January 11, 2018 NHH Norwegian School of Economics 1 Motivation Goals! Extend
More informationComputational Experiments with Cross and Crooked Cross Cuts
Computational Experiments with Cross and Crooked Cross Cuts Sanjeeb Dash IBM Research sanjeebd@us.ibm.com Oktay Günlük IBM Research gunluk@us.ibm.com Juan Pablo Vielma Massachusetts Institute of Technology
More informationA note on : A Superior Representation Method for Piecewise Linear Functions by Li, Lu, Huang and Hu
A note on : A Superior Representation Method for Piecewise Linear Functions by Li, Lu, Huang and Hu Juan Pablo Vielma, Shabbir Ahmed and George Nemhauser H. Milton Stewart School of Industrial and Systems
More informationInteger Programming Methods LNMB
Integer Programming Methods LNMB 2017 2018 Dion Gijswijt homepage.tudelft.nl/64a8q/intpm/ Dion Gijswijt Intro IntPM 2017-2018 1 / 24 Organisation Webpage: homepage.tudelft.nl/64a8q/intpm/ Book: Integer
More informationMEP123: Master Equality Polyhedron with one, two or three rows
1/17 MEP123: Master Equality Polyhedron with one, two or three rows Oktay Günlük Mathematical Sciences Department IBM Research January, 29 joint work with Sanjeeb Dash and Ricardo Fukasawa 2/17 Master
More informationThe structure of the infinite models in integer programming
The structure of the infinite models in integer programming January 10, 2017 Not Again! Well, Aussois is partly responsible... Some years ago: Not Again! Well, Aussois is partly responsible... Some years
More informationChapter 1. Preliminaries
Introduction This dissertation is a reading of chapter 4 in part I of the book : Integer and Combinatorial Optimization by George L. Nemhauser & Laurence A. Wolsey. The chapter elaborates links between
More informationInteger programming (part 2) Lecturer: Javier Peña Convex Optimization /36-725
Integer programming (part 2) Lecturer: Javier Peña Convex Optimization 10-725/36-725 Last time: integer programming Consider the problem min x subject to f(x) x C x j Z, j J where f : R n R, C R n are
More informationOn Counting Lattice Points and Chvátal-Gomory Cutting Planes
On Counting Lattice Points and Chvátal-Gomory Cutting Planes Andrea Lodi 1, Gilles Pesant 2, and Louis-Martin Rousseau 2 1 DEIS, Università di Bologna - andrea.lodi@unibo.it 2 CIRRELT, École Polytechnique
More informationCutting Plane Separators in SCIP
Cutting Plane Separators in SCIP Kati Wolter Zuse Institute Berlin DFG Research Center MATHEON Mathematics for key technologies 1 / 36 General Cutting Plane Method MIP min{c T x : x X MIP }, X MIP := {x
More informationDisjunctive Cuts for Mixed Integer Nonlinear Programming Problems
Disjunctive Cuts for Mixed Integer Nonlinear Programming Problems Pierre Bonami, Jeff Linderoth, Andrea Lodi December 29, 2012 Abstract We survey recent progress in applying disjunctive programming theory
More informationMinimal inequalities for an infinite relaxation of integer programs
Minimal inequalities for an infinite relaxation of integer programs Amitabh Basu Carnegie Mellon University, abasu1@andrew.cmu.edu Michele Conforti Università di Padova, conforti@math.unipd.it Gérard Cornuéjols
More informationA conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization
A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization Pietro Belotti Xpress Optimizer Team, FICO, Birmingham, UK. Julio C. Góez Dept of
More informationBCOL RESEARCH REPORT 14.02
BCOL RESEARCH REPORT 14.02 Industrial Engineering & Operations Research University of California, Berkeley, CA 94720 1777 SUPERMODULAR COVERING KNAPSACK POLYTOPE ALPER ATAMTÜRK AND AVINASH BHARDWAJ Abstract.
More informationA note on : A Superior Representation Method for Piecewise Linear Functions
A note on : A Superior Representation Method for Piecewise Linear Functions Juan Pablo Vielma Business Analytics and Mathematical Sciences Department, IBM T. J. Watson Research Center, Yorktown Heights,
More informationA geometric perspective on lifting
A geometric perspective on lifting Michele Conforti Università di Padova, conforti@math.unipd.it Gérard Cornuéjols Carnegie Mellon University and Université d Aix-Marseille, gc0v@andrew.cmu.edu Giacomo
More informationn-step mingling inequalities: new facets for the mixed-integer knapsack set
Math. Program., Ser. A (2012) 132:79 98 DOI 10.1007/s10107-010-0382-6 FULL LENGTH PAPER n-step mingling inequalities: new facets for the mixed-integer knapsack set Alper Atamtürk Kiavash Kianfar Received:
More informationSplit Rank of Triangle and Quadrilateral Inequalities
Split Rank of Triangle and Quadrilateral Inequalities Santanu Dey 1 Quentin Louveaux 2 June 4, 2009 Abstract A simple relaxation of two rows of a simplex tableau is a mixed integer set consisting of two
More informationIBM Research Report. Lattice-Free Sets, Branching Disjunctions, and Mixed-Integer Programming
RC25212 (W1109-107) September 21, 2011 Mathematics IBM Research Report Lattice-Free Sets, Branching Disjunctions, and Mixed-Integer Programming Sanjeeb Dash, Neil B. Dobbs, Oktay Günlük, Tomasz J. Nowicki,
More informationOn the knapsack closure of 0-1 Integer Linear Programs. Matteo Fischetti University of Padova, Italy
On the knapsack closure of 0-1 Integer Linear Programs Matteo Fischetti University of Padova, Italy matteo.fischetti@unipd.it Andrea Lodi University of Bologna, Italy alodi@deis.unibo.it Aussois, January
More informationSection Notes 9. IP: Cutting Planes. Applied Math 121. Week of April 12, 2010
Section Notes 9 IP: Cutting Planes Applied Math 121 Week of April 12, 2010 Goals for the week understand what a strong formulations is. be familiar with the cutting planes algorithm and the types of cuts
More informationA geometric perspective on lifting
A geometric perspective on lifting Michele Conforti Università di Padova, conforti@math.unipd.it Gérard Cornuéjols Carnegie Mellon University and Université d Aix-Marseille, gc0v@andrew.cmu.edu Giacomo
More information3.7 Cutting plane methods
3.7 Cutting plane methods Generic ILP problem min{ c t x : x X = {x Z n + : Ax b} } with m n matrix A and n 1 vector b of rationals. According to Meyer s theorem: There exists an ideal formulation: conv(x
More informationCorner Polyhedron and Intersection Cuts
Corner Polyhedron and Intersection Cuts Michele Conforti 1,5, Gérard Cornuéjols 2,4 Giacomo Zambelli 3,5 August 2010 Revised March 2011 Abstract Four decades ago, Gomory introduced the corner polyhedron
More informationTHE MIXING SET WITH FLOWS
THE MIXING SET WITH FLOWS MICHELE CONFORTI, MARCO DI SUMMA, AND LAURENCE A. WOLSEY Abstract. We consider the mixing set with flows: s + x t b t, x t y t for 1 t n; s R 1 +, x Rn +, y Zn +. It models a
More informationMixed-integer linear representability, disjunctions, and Chvátal functions modeling implications
1 2 3 4 Mixed-integer linear representability, disjunctions, and Chvátal functions modeling implications Amitabh Basu Kipp Martin Christopher Thomas Ryan Guanyi Wang October 26, 2017 5 6 7 8 9 10 11 12
More informationThe strength of multi-row models 1
The strength of multi-row models 1 Quentin Louveaux 2 Laurent Poirrier 3 Domenico Salvagnin 4 October 6, 2014 Abstract We develop a method for computing facet-defining valid inequalities for any mixed-integer
More informationAdvances in CPLEX for Mixed Integer Nonlinear Optimization
Pierre Bonami and Andrea Tramontani IBM ILOG CPLEX ISMP 2015 - Pittsburgh - July 13 2015 Advances in CPLEX for Mixed Integer Nonlinear Optimization 1 2015 IBM Corporation CPLEX Optimization Studio 12.6.2
More informationOn the knapsack closure of 0-1 Integer Linear Programs
On the knapsack closure of 0-1 Integer Linear Programs Matteo Fischetti 1 Dipartimento di Ingegneria dell Informazione University of Padova Padova, Italy Andrea Lodi 2 Dipartimento di Elettronica, Informatica
More information3.7 Strong valid inequalities for structured ILP problems
3.7 Strong valid inequalities for structured ILP problems By studying the problem structure, we can derive strong valid inequalities yielding better approximations of conv(x ) and hence tighter bounds.
More informationComputing with multi-row Gomory cuts
Computing with multi-row Gomory cuts Daniel G. Espinoza Departamento de Ingeniería Industrial, Universidad de Chile, Av. República 71, Santiago, 837-439, Chile Abstract Recent advances on the understanding
More informationCutting Planes in SCIP
Cutting Planes in SCIP Kati Wolter Zuse-Institute Berlin Department Optimization Berlin, 6th June 2007 Outline 1 Cutting Planes in SCIP 2 Cutting Planes for the 0-1 Knapsack Problem 2.1 Cover Cuts 2.2
More informationComputational Experiments with Cross and Crooked Cross Cuts
Computational Experiments with Cross and Crooked Cross Cuts Sanjeeb Dash IBM Research sanjeebd@us.ibm.com Oktay Günlük IBM Research gunluk@us.ibm.com June 22, 2011 Juan Pablo Vielma University of Pittsburgh
More informationDisjunctive Inequalities: Applications and Extensions
Disjunctive Inequalities: Applications and Extensions Pietro Belotti Leo Liberti Andrea Lodi Giacomo Nannicini Andrea Tramontani 1 Introduction A general optimization problem can be expressed in the form
More informationHow to Convexify the Intersection of a Second Order Cone and a Nonconvex Quadratic
How to Convexify the Intersection of a Second Order Cone and a Nonconvex Quadratic arxiv:1406.1031v2 [math.oc] 5 Jun 2014 Samuel Burer Fatma Kılınç-Karzan June 3, 2014 Abstract A recent series of papers
More information1 Maximal Lattice-free Convex Sets
47-831: Advanced Integer Programming Lecturer: Amitabh Basu Lecture 3 Date: 03/23/2010 In this lecture, we explore the connections between lattices of R n and convex sets in R n. The structures will prove
More informationOn the matrix-cut rank of polyhedra
On the matrix-cut rank of polyhedra William Cook and Sanjeeb Dash Computational and Applied Mathematics Rice University August 5, 00 Abstract Lovász and Schrijver (99) described a semi-definite operator
More informationCutting planes from two rows of simplex tableau
Cutting planes from two rows of simplex tableau Based on talk by Andersen et al, IPCO-2007 Ashutosh Mahajan 1 1 Lehigh University Department of Industrial and Systems Engineering Cor@l Seminar Series -
More informationOn the Exact Separation of Mixed Integer Knapsack Cuts
On the Exact Separation of Mixed Integer Knapsack Cuts Ricardo Fukasawa 1 and Marcos Goycoolea 2 1 H. Milton Stewart School of Industrial and Systems Engineering Georgia Institute of Technology rfukasaw@isye.gatech.edu
More information