Cloud Branching MIP workshop, Ohio State University, 23/Jul/2014
|
|
- Stella Bennett
- 6 years ago
- Views:
Transcription
1 Cloud Branching MIP workshop, Ohio State University, 23/Jul/2014 Timo Berthold Xpress Optimization Team Gerald Gamrath Zuse Institute Berlin Domenico Salvagnin Universita degli Studi di Padova This presentation is provided for the recipient only and cannot be reproduced or shared without Fair Isaac Corporation s express consent.
2 MIP & Branching min s.t. c T x Ax b x Z I 0 R C 0 Mixed Integer Program: linear objective & constraints integer variables continuous variables Branching for MIP: improve dual bound fractional variables the optimum of the LP relaxation x i xi x i xi for i I and xi / Z
3 MIP & Branching min s.t. c T x Ax b x Z I 0 R C 0 Mixed Integer Program: linear objective & constraints integer variables continuous variables Branching for MIP: improve dual bound fractional variables the optimum of the LP relaxation x i xi x i xi for i I and xi / Z
4 MIP & Branching min s.t. c T x Ax b x Z I 0 R C 0 Mixed Integer Program: linear objective & constraints integer variables continuous variables Branching for MIP: improve dual bound fractional variables the optimum of the LP relaxation x i xi x i xi for i I and xi / Z
5 MIP & Branching min s.t. c T x Ax b x Z I 0 R C 0 Mixed Integer Program: linear objective & constraints integer variables continuous variables Branching for MIP: improve dual bound fractional variables the optimum of the LP relaxation x i xi x i xi for i I and xi / Z
6 MIP & Branching min s.t. c T x Ax b x Z I 0 R C 0 Mixed Integer Program: linear objective & constraints integer variables continuous variables Branching for MIP: improve dual bound fractional variables the optimum of the LP relaxation x i xi x i xi for i I and xi / Z
7 MIP & Branching min s.t. c T x Ax b x Z I 0 R C 0 Mixed Integer Program: linear objective & constraints integer variables continuous variables Branching for MIP: improve dual bound fractional variables the optimum of the LP relaxation x i xi x i xi for i I and xi / Z
8 MIP & Branching min s.t. c T x Ax b x Z I 0 R C 0 Mixed Integer Program: linear objective & constraints integer variables continuous variables Branching for MIP: improve dual bound fractional variables the optimum of the LP relaxation x i xi x i xi for i I and xi / Z
9 MIP & Branching min s.t. c T x Ax b x Z I 0 R C 0 Mixed Integer Program: linear objective & constraints integer variables continuous variables Branching for MIP: improve dual bound fractional variables the optimum of the LP relaxation x i xi x i xi for i I and xi / Z
10 MIP & Branching min s.t. c T x Ax b x Z I 0 R C 0 Mixed Integer Program: linear objective & constraints integer variables continuous variables Branching for MIP: improve dual bound fractional variables the optimum of the LP relaxation x i xi x i xi for i I and xi / Z
11 Degeneracy naïvely: 1 optimal solution, determined by n constraints/bounds
12 Degeneracy naïvely: 1 optimal solution, determined by n constraints/bounds at a second thought: 1 optimal solution, k > n tight constraints
13 Degeneracy naïvely: 1 optimal solution, determined by n constraints/bounds at a second thought: 1 optimal solution, k > n tight constraints but really: an optimal polyhedron
14 Degeneracy naïvely: 1 optimal solution, determined by n constraints/bounds at a second thought: 1 optimal solution, k > n tight constraints but really: an optimal polyhedron
15 Degeneracy naïvely: 1 optimal solution, determined by n constraints/bounds at a second thought: 1 optimal solution, k > n tight constraints but really: an optimal polyhedron Goal of this talk: branch on a set (a cloud) of solutions
16 How degenerated is the typical MIP? Nonbasic columns (incl. slacks) with reduced costs % 10% 20% 30% 40% 50% 60% 70% 80% 90% 100% 0 MIPLIB 3, MIPLIB2003, MIPLIB2010, Cor@l (462 instances) only 12.5% not dual degenerated dichotomy: either few degeneracy or a lot of
17 How degenerated is the typical MIP? Nonbasic columns (incl. slacks) with reduced costs % 10% 20% 30% 40% 50% 60% 70% 80% 90% 100% 0 MIPLIB 3, MIPLIB2003, MIPLIB2010, Cor@l (462 instances) only 12.5% not dual degenerated dichotomy: either few degeneracy or a lot of presolving/cuts do not change this picture by much
18 Two questions Goal of this talk: branch on a cloud of solutions 1. How do we get extra optimal solutions? 2. How do we use this extra knowledge?
19 Generating cloud points 1. How do we get extra optimal solutions? restrict LP to optimal face min/max each variable (OBBT) feasibility pump objective (pump-reduce [Achterberg2010])
20 Generating cloud points 1. How do we get extra optimal solutions? restrict LP to optimal face min/max each variable (OBBT) feasibility pump objective (pump-reduce [Achterberg2010]) x 1 = 0.4 x 2 = 0.55
21 Generating cloud points 1. How do we get extra optimal solutions? restrict LP to optimal face min/max each variable (OBBT) feasibility pump objective (pump-reduce [Achterberg2010]) min x 1 x 1 = 0.4 x 2 = 0.55
22 Generating cloud points 1. How do we get extra optimal solutions? restrict LP to optimal face min/max each variable (OBBT) feasibility pump objective (pump-reduce [Achterberg2010]) max x 1 x 1 [0.4, 1.0] x 2 [0.55, 0.7]
23 Generating cloud points 1. How do we get extra optimal solutions? restrict LP to optimal face min/max each variable (OBBT) feasibility pump objective (pump-reduce [Achterberg2010]) min x 2 x 1 [0.4, 1.0] x 2 [0.0, 0.7]
24 Generating cloud points 1. How do we get extra optimal solutions? restrict LP to optimal face min/max each variable (OBBT) feasibility pump objective (pump-reduce [Achterberg2010]) max x 2 x 1 [0.4, 1.0] x 2 [0.0, 1.0]
25 Generating cloud points 1. How do we get extra optimal solutions? restrict LP to optimal face min/max each variable (OBBT) feasibility pump objective (pump-reduce [Achterberg2010]) max x 2 x 1 [0.4, 1.0] x 2 [0.0, 1.0] intervals instead of values
26 Generating cloud points 1. How do we get extra optimal solutions? restrict LP to optimal face min/max each variable (OBBT) feasibility pump objective (pump-reduce [Achterberg2010]) min (x, x) = x j x j x 1 = 0.4 x 2 = 0.55
27 Generating cloud points 1. How do we get extra optimal solutions? restrict LP to optimal face min/max each variable (OBBT) feasibility pump objective (pump-reduce [Achterberg2010]) min (x, x) = x j x j = x 1 + x 2 x 1 = 0.4 x 2 = 0.55
28 Generating cloud points 1. How do we get extra optimal solutions? restrict LP to optimal face min/max each variable (OBBT) feasibility pump objective (pump-reduce [Achterberg2010]) min (x, x) = x j x j = x 1 + x 2 x 1 [0.4, 0.55] x 2 [0.55, 0.9]
29 Generating cloud points 1. How do we get extra optimal solutions? restrict LP to optimal face min/max each variable (OBBT) feasibility pump objective (pump-reduce [Achterberg2010]) min (x, x) = x j x j = +x 1 + x 2 x 1 [0.4, 0.55] x 2 [0.55, 0.9]
30 Generating cloud points 1. How do we get extra optimal solutions? restrict LP to optimal face min/max each variable (OBBT) feasibility pump objective (pump-reduce [Achterberg2010]) min (x, x) = x j x j = +x 1 + x 2 x 1 [0.4, 0.9] x 2 [0.55, 1.0]
31 Generating cloud points 1. How do we get extra optimal solutions? restrict LP to optimal face min/max each variable (OBBT) feasibility pump objective (pump-reduce [Achterberg2010]) min (x, x) = x j x j = +x 1 + x 2 x 1 [0.4, 0.9] x 2 [0.55, 1.0] heuristic intervals stalling is cheap!
32 Branching rules in MIP 2. How do we use this extra knowledge? 1. Pseudocost branching [BenichouEtAl1971] try to estimate LP values, based on history information effective, cheap, but weak in the beginning combine with strong branching (reliability, hybrid) 2. Strong branching [ApplegateEtAl1995] solve tentative LP relaxations for some candidates effective w.r.t. number of nodes, expensive w.r.t. time 3. Most infeasible branching often referred to as a simple standard rule computationally as bad as random branching!
33 Exploiting cloud points (pseudocost branching) 2.1 How do we use this extra knowledge? z = c T x z = c T x j + j x j x j pseudocost update x j ς + j = xj x and ς j j = xj xj pseudocost-based estimation + j = Ψ + j ( x j x j ) and j x j = Ψ j (x j x j ) x j x j
34 Exploiting cloud points (pseudocost branching) 2.1 How do we use this extra knowledge? z = c T x z = c T x j + j x j l j x j pseudocost update u j x j ς + j = xj x... better: ς + j j = xj u j pseudocost-based estimation + j = Ψ + j ( x j x j ) and j x j = Ψ j (x j x j ) x j x j
35 Exploiting cloud points (pseudocost branching) 2.1 How do we use this extra knowledge? z = c T x z = c T x j j + j + j x j l j x j pseudocost update u j x j ς + j = xj x... better: ς + j j = xj u j pseudocost-based estimation + j = Ψ + j ( x j x j )... better: + j x j l j x j u j = Ψ + j ( x j u j ) x j
36 Observation Lemma Let x be an optimal solution of the LP relaxation at a given branch-and-bound node and xj l j xj u j xj. Then 1. for fixed and, it holds that ς + j ς + j and ς j ς j, respectively; 2. for fixed Ψ + j and Ψ j, it holds that + j + j and j j, respectively.
37 Exploiting cloud points (strong branching) 2.2 How do we use this extra knowledge? Full strong branching: solves 2 #frac. var s many LPs uses product of improvement values as branching score improvement on both sides better than on one
38 Exploiting cloud points (strong branching) 2.2 How do we use this extra knowledge? Full strong branching: solves 2 #frac. var s many LPs uses product of improvement values as branching score improvement on both sides better than on one Benefit of cloud intervals: frac. var. gets integral in cloud point one LP spared cloud branching acts as a filter new frac. var. s new candidates (one side known) Idea: Use 3-partition of branching candidates
39 Exploiting cloud points (most inf branching) 2.3 How do we use this extra knowledge? Most infeasible branching branch on variable with maximal fractionality min(xj xj, xj xj ) computationally as bad as random branching! maybe because xj is random within cloud interval?
40 Exploiting cloud points (most inf branching) 2.3 How do we use this extra knowledge? Most infeasible branching branch on variable with maximal fractionality min(xj xj, xj xj ) computationally as bad as random branching! maybe because xj is random within cloud interval? x i x i x i x j x j x j Most infeasible with cloud intervals: select x i with maximal min( y z : y [l i, u i ], z Z) direction in which the optimal face has a small diameter
41 Exploiting cloud points (most inf branching) 2.3 How do we use this extra knowledge? Most infeasible branching branch on variable with maximal fractionality min(xj xj, xj xj ) computationally as bad as random branching! maybe because xj is random within cloud interval? x i l xi i u i x j l j u j x j Most infeasible with cloud intervals: select x i with maximal min( y z : y [l i, u i ], z Z) direction in which the optimal face has a small diameter
42 Experimental environment implementation within SCIP pristine settings: No cuts, no heurs, DFS cutoff = optimum branch to prove optimality MIPLIB MIPLIB 3.0, 2003, 2010 industry and academics 168 benchmark instances Cor@l huge collection of 350 instances many combinatorial ones mainly collected from NEOS server Focus: Tree size reduction by cloud information
43 Cloud intervals at root node Cloud statistics: interval size: average: 0.56 g. mean: 0.25 success rate: average: 65% g. mean: 39% LP iter/success: average: g. mean: From now on, exclude: No objective, solved at root, no dual degeneracy at root, highly symmetric leaves 158 instances in testbed Note: Did not use cloud points for anything else (heuristics, cuts)
44 Computational results Pseudocost branching pscost cloud solved time (all opt) nodes (all opt) OBBT takes a lot of time! fewer nodes better branching choices more reliable estimates
45 Computational results Most infeasible branching mostinf cloud solved time (all opt) nodes (all opt) running time doubles but: enumerational effort (=nodes) nearly halved
46 Computational results Most infeasible branching mostinf cloud solved time (all opt) nodes (all opt) running time doubles but: enumerational effort (=nodes) nearly halved Better than random! :-)
47 Cloud strong branching algorithm frac. var. gets integral in cloud point one LP spared Idea: Use 3-partition F 2, F 1, F 0 of branching candidates improvements in both directions for F 2 disregard F 1 F 0 improvement in one direction for F 2 F 1 disregard F 0 alternatively: Only use F 2
48 Cloud strong branching algorithm frac. var. gets integral in cloud point one LP spared Idea: Use 3-partition F 2, F 1, F 0 of branching candidates improvements in both directions for F 2 disregard F 1 F 0 improvement in one direction for F 2 F 1 disregard F 0 alternatively: Only use F 2 stop pump-reduce procedure when new cloud point does not imply new integral bound
49 Computational results Full strong branching full test sets, default settings, heuristic pump-reduce strong branch cloud branch Test set Nodes Time (s) Nodes Time (s) MIPLIB little less nodes 5.5% faster on MIPLIB (few affected instances) 30% faster on
50 Wrap up Conclusion: exploit knowledge of alternative relaxation optima mostinf: 44% nodes, pscost: 26%, hybrid: 13% full strong branching: 30% running time Outlook: faster generation of cloud intervals? predictions when cloud branching is worthwhile? cloud points from alternative relaxations (MINLP!) SB: nonchimerical + cloud + propagation =?
51 Commercial break Xpress Optimization Suite 7.7 came out in April 2014 Highlights: parallel dual simplex (mini iterations) MIP presolving w.r.t. objective Mosel support for robust constraints and uncertainty improved performance on MISOCP XPRESS MOSEK GUROBI CPLEX SCIP (MI)SOCP Benchmark (17/Jun/2014)
52 Commercial break Xpress Optimization Suite 7.7 came out in April 2014 Highlights: parallel dual simplex (mini iterations) MIP presolving w.r.t. objective Mosel support for robust constraints and uncertainty improved performance on MISOCP XPRESS MOSEK GUROBI CPLEX SCIP (MI)SOCP Benchmark (17/Jun/2014) Coming soon: Cloud branching
53 Thank You Timo Berthold This presentation is provided for the recipient only and cannot be reproduced or shared without Fair Isaac Corporation s express consent.
The MIP-Solving-Framework SCIP
The MIP-Solving-Framework SCIP Timo Berthold Zuse Institut Berlin DFG Research Center MATHEON Mathematics for key technologies Berlin, 23.05.2007 What Is A MIP? Definition MIP The optimization problem
More informationGeorge Reloaded. M. Monaci (University of Padova, Italy) joint work with M. Fischetti. MIP Workshop, July 2010
George Reloaded M. Monaci (University of Padova, Italy) joint work with M. Fischetti MIP Workshop, July 2010 Why George? Because of Karzan, Nemhauser, Savelsbergh Information-based branching schemes for
More informationExploiting Degeneracy in MIP
Exploiting Degeneracy in MIP Tobias Achterberg 9 January 2018 Aussois Performance Impact in Gurobi 7.5+ 35% 32.0% 30% 25% 20% 15% 14.6% 10% 5.7% 7.9% 6.6% 5% 0% 2.9% 1.2% 0.1% 2.6% 2.6% Time limit: 10000
More informationPrimal Heuristics in SCIP
Primal Heuristics in SCIP Timo Berthold Zuse Institute Berlin DFG Research Center MATHEON Mathematics for key technologies Berlin, 10/11/2007 Outline 1 Introduction Basics Integration Into SCIP 2 Available
More informationThe Gurobi Optimizer. Bob Bixby
The Gurobi Optimizer Bob Bixby Outline Gurobi Introduction Company Products Benchmarks Gurobi Technology Rethinking MIP MIP as a bag of tricks 8-Jul-11 2010 Gurobi Optimization 2 Gurobi Optimization Incorporated
More informationExact solutions to mixed-integer linear programming problems
Exact solutions to mixed-integer linear programming problems Dan Steffy Zuse Institute Berlin and Oakland University Joint work with Bill Cook, Thorsten Koch and Kati Wolter November 18, 2011 Mixed-Integer
More informationUsing Multiple Machines to Solve Models Faster with Gurobi 6.0
Using Multiple Machines to Solve Models Faster with Gurobi 6.0 Distributed Algorithms in Gurobi 6.0 Gurobi 6.0 includes 3 distributed algorithms Distributed concurrent LP (new in 6.0) MIP Distributed MIP
More informationApplied Mixed Integer Programming: Beyond 'The Optimum'
Applied Mixed Integer Programming: Beyond 'The Optimum' 14 Nov 2016, Simons Institute, Berkeley Pawel Lichocki Operations Research Team, Google https://developers.google.com/optimization/ Applied Mixed
More informationWelcome to the Webinar. What s New in Gurobi 7.5
Welcome to the Webinar What s New in Gurobi 7.5 Speaker Introduction Dr. Tobias Achterberg Director of R&D at Gurobi Optimization Formerly a developer at ILOG, where he worked on CPLEX 11.0 to 12.6 Obtained
More informationHeuristics in Commercial MIP Solvers Part I (Heuristics in IBM CPLEX)
Andrea Tramontani CPLEX Optimization, IBM CWI, Amsterdam, June 12, 2018 Heuristics in Commercial MIP Solvers Part I (Heuristics in IBM CPLEX) Agenda CPLEX Branch-and-Bound (B&B) Primal heuristics in CPLEX
More informationSCIP. 1 Introduction. 2 Model requirements. Contents. Stefan Vigerske, Humboldt University Berlin, Germany
SCIP Stefan Vigerske, Humboldt University Berlin, Germany Contents 1 Introduction.................................................. 673 2 Model requirements..............................................
More informationMVE165/MMG630, Applied Optimization Lecture 8 Integer linear programming algorithms. Ann-Brith Strömberg
MVE165/MMG630, Integer linear programming algorithms Ann-Brith Strömberg 2009 04 15 Methods for ILP: Overview (Ch. 14.1) Enumeration Implicit enumeration: Branch and bound Relaxations Decomposition methods:
More informationParallel and Distributed Optimization with Gurobi Optimizer
Parallel and Distributed Optimization with Gurobi Optimizer Our Presenter Dr. Tobias Achterberg Developer, Gurobi Optimization 2 Parallel & Distributed Optimization 3 Terminology for this presentation
More information3 INTEGER LINEAR PROGRAMMING
3 INTEGER LINEAR PROGRAMMING PROBLEM DEFINITION Integer linear programming problem (ILP) of the decision variables x 1,..,x n : (ILP) subject to minimize c x j j n j= 1 a ij x j x j 0 x j integer n j=
More informationThe Heuristic (Dark) Side of MIP Solvers. Asja Derviskadic, EPFL Vit Prochazka, NHH Christoph Schaefer, EPFL
The Heuristic (Dark) Side of MIP Solvers Asja Derviskadic, EPFL Vit Prochazka, NHH Christoph Schaefer, EPFL 1 Table of content [Lodi], The Heuristic (Dark) Side of MIP Solvers, Hybrid Metaheuristics, 273-284,
More informationHow to use your favorite MIP Solver: modeling, solving, cannibalizing. Andrea Lodi University of Bologna, Italy
How to use your favorite MIP Solver: modeling, solving, cannibalizing Andrea Lodi University of Bologna, Italy andrea.lodi@unibo.it January-February, 2012 @ Universität Wien A. Lodi, How to use your favorite
More informationIntroduction to Mathematical Programming IE496. Final Review. Dr. Ted Ralphs
Introduction to Mathematical Programming IE496 Final Review Dr. Ted Ralphs IE496 Final Review 1 Course Wrap-up: Chapter 2 In the introduction, we discussed the general framework of mathematical modeling
More informationPivot and Gomory Cut. A MIP Feasibility Heuristic NSERC
Pivot and Gomory Cut A MIP Feasibility Heuristic Shubhashis Ghosh Ryan Hayward shubhashis@randomknowledge.net hayward@cs.ualberta.ca NSERC CGGT 2007 Kyoto Jun 11-15 page 1 problem given a MIP, find a feasible
More informationThe Ascendance of the Dual Simplex Method: A Geometric View
The Ascendance of the Dual Simplex Method: A Geometric View Robert Fourer 4er@ampl.com AMPL Optimization Inc. www.ampl.com +1 773-336-AMPL U.S.-Mexico Workshop on Optimization and Its Applications Huatulco
More informationAddressing degeneracy in the dual simplex algorithm using a decompositon approach
Addressing degeneracy in the dual simplex algorithm using a decompositon approach Ambros Gleixner, Stephen J Maher, Matthias Miltenberger Zuse Institute Berlin Berlin, Germany 16th July 2015 @sj_maher
More informationRENS. The optimal rounding. Timo Berthold
Math. Prog. Comp. (2014) 6:33 54 DOI 10.1007/s12532-013-0060-9 FULL LENGTH PAPER RENS The optimal rounding Timo Berthold Received: 25 April 2012 / Accepted: 2 October 2013 / Published online: 1 November
More informationPenalty Alternating Direction Methods for Mixed- Integer Optimization: A New View on Feasibility Pumps
Penalty Alternating Direction Methods for Mixed- Integer Optimization: A New View on Feasibility Pumps Björn Geißler, Antonio Morsi, Lars Schewe, Martin Schmidt FAU Erlangen-Nürnberg, Discrete Optimization
More informationConstraint Branching and Disjunctive Cuts for Mixed Integer Programs
Constraint Branching and Disunctive Cuts for Mixed Integer Programs Constraint Branching and Disunctive Cuts for Mixed Integer Programs Michael Perregaard Dash Optimization Constraint Branching and Disunctive
More informationBasic Concepts of Constraint Integer Programming
Basic Concepts of Constraint Integer Programming Ambros Gleixner Zuse Institute Berlin September 30, 2015 Outline SCIP Solving Constraint Integer Programs 4 methodologies in optimization An integrated
More informationAssessing Performance of Parallel MILP Solvers
Assessing Performance of Parallel MILP Solvers How Are We Doing, Really? Ted Ralphs 1 Stephen J. Maher 2, Yuji Shinano 3 1 COR@L Lab, Lehigh University, Bethlehem, PA USA 2 Lancaster University, Lancaster,
More informationAdvanced Use of GAMS Solver Links
Advanced Use of GAMS Solver Links Michael Bussieck, Steven Dirkse, Stefan Vigerske GAMS Development 8th January 2013, ICS Conference, Santa Fe Standard GAMS solve Solve william minimizing cost using mip;
More informationAlgorithms II MIP Details
Algorithms II MIP Details What s Inside Gurobi Optimizer Algorithms for continuous optimization Algorithms for discrete optimization Automatic presolve for both LP and MIP Algorithms to analyze infeasible
More informationFebruary 19, Integer programming. Outline. Problem formulation. Branch-andbound
Olga Galinina olga.galinina@tut.fi ELT-53656 Network Analysis and Dimensioning II Department of Electronics and Communications Engineering Tampere University of Technology, Tampere, Finland February 19,
More informationOn Mixed-Integer (Linear) Programming and its connection with Data Science
On Mixed-Integer (Linear) Programming and its connection with Data Science Andrea Lodi Canada Excellence Research Chair École Polytechnique de Montréal, Québec, Canada andrea.lodi@polymtl.ca January 16-20,
More informationSCIP Workshop 2014, Berlin, September 30, Introduction to SCIP
SCIP Workshop 2014, Berlin, September 30, 2014 Introduction to SCIP ZIB: Fast Algorithms Fast Computers Konrad-Zuse-Zentrum für Informationstechnik Berlin non-university research institute of the state
More informationRounding and Propagation Heuristics for Mixed Integer Programming
Konrad-Zuse-Zentrum für Informationstechnik Berlin Takustraße 7 D-9 Berlin-Dahlem Germany TOBIAS ACHTERBERG TIMO BERTHOLD GREGOR HENDEL Rounding and Propagation Heuristics for Mixed Integer Programming
More informationFundamentals of Integer Programming
Fundamentals of Integer Programming Di Yuan Department of Information Technology, Uppsala University January 2018 Outline Definition of integer programming Formulating some classical problems with integer
More informationMotivation for Heuristics
MIP Heuristics 1 Motivation for Heuristics Why not wait for branching? Produce feasible solutions as quickly as possible Often satisfies user demands Avoid exploring unproductive sub trees Better reduced
More informationSection Notes 5. Review of Linear Programming. Applied Math / Engineering Sciences 121. Week of October 15, 2017
Section Notes 5 Review of Linear Programming Applied Math / Engineering Sciences 121 Week of October 15, 2017 The following list of topics is an overview of the material that was covered in the lectures
More information15.083J Integer Programming and Combinatorial Optimization Fall Enumerative Methods
5.8J Integer Programming and Combinatorial Optimization Fall 9 A knapsack problem Enumerative Methods Let s focus on maximization integer linear programs with only binary variables For example: a knapsack
More informationState-of-the-Optimization using Xpress-MP v2006
State-of-the-Optimization using Xpress-MP v2006 INFORMS Annual Meeting Pittsburgh, USA November 5 8, 2006 by Alkis Vazacopoulos Outline LP benchmarks Xpress performance on MIPLIB 2003 Conclusions 3 Barrier
More informationPrimal Heuristics for Branch-and-Price Algorithms
Primal Heuristics for Branch-and-Price Algorithms Marco Lübbecke and Christian Puchert Abstract In this paper, we present several primal heuristics which we implemented in the branch-and-price solver GCG
More informationA Feasibility Pump heuristic for general Mixed-Integer Problems
A Feasibility Pump heuristic for general Mixed-Integer Problems Livio Bertacco, Matteo Fischetti, Andrea Lodi Department of Pure & Applied Mathematics, University of Padova, via Belzoni 7-35131 Padova
More informationExperiments On General Disjunctions
Experiments On General Disjunctions Some Dumb Ideas We Tried That Didn t Work* and Others We Haven t Tried Yet *But that may provide some insight Ted Ralphs, Serdar Yildiz COR@L Lab, Department of Industrial
More informationMIPLIB Mixed Integer Programming Library version 5
Math. Prog. Comp. (2011) 3:103 163 DOI 10.1007/s12532-011-0025-9 FULL LENGTH PAPER MIPLIB 2010 Mixed Integer Programming Library version 5 Thorsten Koch Tobias Achterberg Erling Andersen Oliver Bastert
More informationLP SCIP NEOS URL. example1.lp 2.1 LP 1. minimize. subject to, bounds, free, general, binary, end. .lp 1 2.2
c LP SCIP LP SCIP NEOS 1. URL 2. 2.1 LP 1 LP LP.lp 1 184 8588 2 24 16 1 minimize 3x +4.5y 2z 1 + f subject to g 1,1 + g 1,2 5, 3g 1,1 7g 1,2 + z 2 10, 2f g 1,1 =6, x +0.5y = 4.6, f 0, y 0, g 1,2 0, g 1,1
More informationMVE165/MMG631 Linear and integer optimization with applications Lecture 9 Discrete optimization: theory and algorithms
MVE165/MMG631 Linear and integer optimization with applications Lecture 9 Discrete optimization: theory and algorithms Ann-Brith Strömberg 2018 04 24 Lecture 9 Linear and integer optimization with applications
More informationLocalSolver 4.0: novelties and benchmarks
LocalSolver 4.0: novelties and benchmarks Thierry Benoist Julien Darlay Bertrand Estellon Frédéric Gardi Romain Megel www.localsolver.com 1/18 LocalSolver 3.1 Solver for combinatorial optimization Simple
More informationAn Introduction to Dual Ascent Heuristics
An Introduction to Dual Ascent Heuristics Introduction A substantial proportion of Combinatorial Optimisation Problems (COPs) are essentially pure or mixed integer linear programming. COPs are in general
More informationThe Three Phases of MIP Solving
Zuse Institute Berlin Takustrasse 7 D-14195 Berlin-Dahlem Germany TIMO BERTHOLD, GREGOR HENDEL, AND THORSTEN KOCH The Three Phases of MIP Solving The work for this article has been conducted within the
More informationRestrict-and-relax search for 0-1 mixed-integer programs
EURO J Comput Optim (23) :2 28 DOI.7/s3675-3-7-y ORIGINAL PAPER Restrict-and-relax search for - mixed-integer programs Menal Guzelsoy George Nemhauser Martin Savelsbergh Received: 2 September 22 / Accepted:
More informationIntroduction to Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras
Introduction to Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Module - 05 Lecture - 24 Solving LPs with mixed type of constraints In the
More informationSolving a Challenging Quadratic 3D Assignment Problem
Solving a Challenging Quadratic 3D Assignment Problem Hans Mittelmann Arizona State University Domenico Salvagnin DEI - University of Padova Quadratic 3D Assignment Problem Quadratic 3D Assignment Problem
More informationSolving a Challenging Quadratic 3D Assignment Problem
Solving a Challenging Quadratic 3D Assignment Problem Hans Mittelmann Arizona State University Domenico Salvagnin DEI - University of Padova Quadratic 3D Assignment Problem Quadratic 3D Assignment Problem
More informationConflict Analysis in Mixed Integer Programming
Konrad-Zuse-Zentrum für Informationstechnik Berlin Takustraße 7 D-14195 Berlin-Dahlem Germany TOBIAS ACHTERBERG Conflict Analysis in Mixed Integer Programming URL: http://www.zib.de/projects/integer-optimization/mip
More informationLinear & Integer Programming: A Decade of Computation
Linear & Integer Programming: A Decade of Computation Robert E. Bixby, Mary Fenelon, Zongao Gu, Irv Lustig, Ed Rothberg, Roland Wunderling 1 Outline Progress in computing machines Linear programming (LP)
More informationAdvanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras
Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture 18 All-Integer Dual Algorithm We continue the discussion on the all integer
More informationThe AIMMS Outer Approximation Algorithm for MINLP
The AIMMS Outer Approximation Algorithm for MINLP (using GMP functionality) By Marcel Hunting marcel.hunting@aimms.com November 2011 This document describes how to use the GMP variant of the AIMMS Outer
More informationHandling first-order linear constraints with SCIP
Handling first-order linear constraints with SCIP James Cussens, University of York KU Leuven, 2015-02-16 James Cussens, University of York FO with SCIP KU Leuven, 2015-02-16 1 / 18 MIP Mixed integer programs
More informationBranching rules revisited
Operations Research Letters 33 (2005) 42 54 Operations Research Letters www.elsevier.com/locate/dsw Branching rules revisited Tobias Achterberg a;, Thorsten Koch a, Alexander Martin b a Konrad-Zuse-Zentrum
More informationAlgorithms for Decision Support. Integer linear programming models
Algorithms for Decision Support Integer linear programming models 1 People with reduced mobility (PRM) require assistance when travelling through the airport http://www.schiphol.nl/travellers/atschiphol/informationforpassengerswithreducedmobility.htm
More informationThe AIMMS Outer Approximation Algorithm for MINLP
The AIMMS Outer Approximation Algorithm for MINLP (using GMP functionality) By Marcel Hunting Paragon Decision Technology BV An AIMMS White Paper November, 2011 Abstract This document describes how to
More informationInteger Programming ISE 418. Lecture 7. Dr. Ted Ralphs
Integer Programming ISE 418 Lecture 7 Dr. Ted Ralphs ISE 418 Lecture 7 1 Reading for This Lecture Nemhauser and Wolsey Sections II.3.1, II.3.6, II.4.1, II.4.2, II.5.4 Wolsey Chapter 7 CCZ Chapter 1 Constraint
More informationParallel Solvers for Mixed Integer Linear Optimization
Industrial and Systems Engineering Parallel Solvers for Mixed Integer Linear Optimization Ted Ralphs Lehigh University, Bethlehem, PA, USA Yuji Shinano Zuse Institute Berlin, Takustraße 7, 14195 Berlin,
More information5.4 Pure Minimal Cost Flow
Pure Minimal Cost Flow Problem. Pure Minimal Cost Flow Networks are especially convenient for modeling because of their simple nonmathematical structure that can be easily portrayed with a graph. This
More informationThe Size Robust Multiple Knapsack Problem
MASTER THESIS ICA-3251535 The Size Robust Multiple Knapsack Problem Branch and Price for the Separate and Combined Recovery Decomposition Model Author: D.D. Tönissen, Supervisors: dr. ir. J.M. van den
More informationComputational Integer Programming. Lecture 12: Branch and Cut. Dr. Ted Ralphs
Computational Integer Programming Lecture 12: Branch and Cut Dr. Ted Ralphs Computational MILP Lecture 12 1 Reading for This Lecture Wolsey Section 9.6 Nemhauser and Wolsey Section II.6 Martin Computational
More informationAlgorithms for Integer Programming
Algorithms for Integer Programming Laura Galli November 9, 2016 Unlike linear programming problems, integer programming problems are very difficult to solve. In fact, no efficient general algorithm is
More informationLinear Programming. Course review MS-E2140. v. 1.1
Linear Programming MS-E2140 Course review v. 1.1 Course structure Modeling techniques Linear programming theory and the Simplex method Duality theory Dual Simplex algorithm and sensitivity analysis Integer
More informationGurobi Guidelines for Numerical Issues February 2017
Gurobi Guidelines for Numerical Issues February 2017 Background Models with numerical issues can lead to undesirable results: slow performance, wrong answers or inconsistent behavior. When solving a model
More informationAdvanced Operations Research Techniques IE316. Quiz 2 Review. Dr. Ted Ralphs
Advanced Operations Research Techniques IE316 Quiz 2 Review Dr. Ted Ralphs IE316 Quiz 2 Review 1 Reading for The Quiz Material covered in detail in lecture Bertsimas 4.1-4.5, 4.8, 5.1-5.5, 6.1-6.3 Material
More informationCS 473: Algorithms. Ruta Mehta. Spring University of Illinois, Urbana-Champaign. Ruta (UIUC) CS473 1 Spring / 36
CS 473: Algorithms Ruta Mehta University of Illinois, Urbana-Champaign Spring 2018 Ruta (UIUC) CS473 1 Spring 2018 1 / 36 CS 473: Algorithms, Spring 2018 LP Duality Lecture 20 April 3, 2018 Some of the
More informationIntroduction to SCIP. Gregor Hendel, SCIP Introduction Day September 26, rd IMI-ISM-ZIB MODAL Workshop
Introduction to SCIP Gregor Hendel, hendel@zib.de SCIP Introduction Day September 26, 2018 3rd IMI-ISM-ZIB MODAL Workshop What is SCIP? SCIP (Solving Constraint Integer Programs)... provides a full-scale
More informationME 391Q Network Flow Programming
ME 9Q Network Flow Programming Final Exam, Summer 00. ( Points) The figure below shows an undirected network. The parameters on the edges are the edge lengths. Find the shortest path tree using Dijkstra
More informationSCIP Workshop Visit scip.zib.de/workshop2018 for all information. Tomorrow and on Thursday: Scientific Talks
SCIP Workshop 2018 Structure of the SCIP Introduction Day 9:30 11:00 Introduction to SCIP 11:00 11:30 Coffee Break 11:30 12:30 Installation of SCIP and GCG 12:30 14:00 Lunch 14:00 17:30 Programming Exercises
More informationOutline. Modeling. Outline DMP204 SCHEDULING, TIMETABLING AND ROUTING. 1. Models Lecture 5 Mixed Integer Programming Models and Exercises
Outline DMP204 SCHEDULING, TIMETABLING AND ROUTING 1. Lecture 5 Mixed Integer Programming and Exercises Marco Chiarandini 2. 3. 2 Outline Modeling 1. Min cost flow Shortest path 2. Max flow Assignment
More informationMATHEMATICS II: COLLECTION OF EXERCISES AND PROBLEMS
MATHEMATICS II: COLLECTION OF EXERCISES AND PROBLEMS GRADO EN A.D.E. GRADO EN ECONOMÍA GRADO EN F.Y.C. ACADEMIC YEAR 2011-12 INDEX UNIT 1.- AN INTRODUCCTION TO OPTIMIZATION 2 UNIT 2.- NONLINEAR PROGRAMMING
More informationPrimal Heuristics for Mixed Integer Programs with a Staircase Structure
Primal Heuristics for Mixed Integer Programs with a Staircase Structure Marco E. Lübbecke and Christian Puchert Chair of Operations Research, RWTH Aachen University, Kackertstr. 7, 52072 Aachen, Germany
More informationColumn Generation Based Primal Heuristics
Column Generation Based Primal Heuristics C. Joncour, S. Michel, R. Sadykov, D. Sverdlov, F. Vanderbeck University Bordeaux 1 & INRIA team RealOpt Outline 1 Context Generic Primal Heuristics The Branch-and-Price
More informationPure Cutting Plane Methods for ILP: a computational perspective
Pure Cutting Plane Methods for ILP: a computational perspective Matteo Fischetti, DEI, University of Padova Rorschach test for OR disorders: can you see the tree? 1 Outline 1. Pure cutting plane methods
More informationDual-fitting analysis of Greedy for Set Cover
Dual-fitting analysis of Greedy for Set Cover We showed earlier that the greedy algorithm for set cover gives a H n approximation We will show that greedy produces a solution of cost at most H n OPT LP
More information5.3 Cutting plane methods and Gomory fractional cuts
5.3 Cutting plane methods and Gomory fractional cuts (ILP) min c T x s.t. Ax b x 0integer feasible region X Assumption: a ij, c j and b i integer. Observation: The feasible region of an ILP can be described
More informationImproving branch-and-cut performance by random sampling
Math. Prog. Comp. (2016) 8:113 132 DOI 10.1007/s12532-015-0096-0 FULL LENGTH PAPER Improving branch-and-cut performance by random sampling Matteo Fischetti 1 Andrea Lodi 2 Michele Monaci 1 Domenico Salvagnin
More informationSolving Linear and Integer Programs
Solving Linear and Integer Programs Robert E. Bixby Gurobi Optimization, Inc. and Rice University Overview Linear Programming: Example and introduction to basic LP, including duality Primal and dual simplex
More informationLinear programming and duality theory
Linear programming and duality theory Complements of Operations Research Giovanni Righini Linear Programming (LP) A linear program is defined by linear constraints, a linear objective function. Its variables
More informationAdvanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras
Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture 16 Cutting Plane Algorithm We shall continue the discussion on integer programming,
More informationHeuristics in MILP. Group 1 D. Assouline, N. Molyneaux, B. Morén. Supervisors: Michel Bierlaire, Andrea Lodi. Zinal 2017 Winter School
Heuristics in MILP Group 1 D. Assouline, N. Molyneaux, B. Morén Supervisors: Michel Bierlaire, Andrea Lodi Zinal 2017 Winter School 0 / 23 Primal heuristics Original paper: Fischetti, M. and Lodi, A. (2011).
More informationTree Search Stabilization by Random Sampling
Noname manuscript No. (will be inserted by the editor) Tree Search Stabilization by Random Sampling Matteo Fischetti Andrea Lodi Michele Monaci Domenico Salvagnin Andrea Tramontani Submitted: September
More informationCOMP9334: Capacity Planning of Computer Systems and Networks
COMP9334: Capacity Planning of Computer Systems and Networks Week 10: Optimisation (1) A/Prof Chun Tung Chou CSE, UNSW COMP9334, Chun Tung Chou, 2016 Three Weeks of Optimisation The lectures for these
More informationLinear Programming. Linear programming provides methods for allocating limited resources among competing activities in an optimal way.
University of Southern California Viterbi School of Engineering Daniel J. Epstein Department of Industrial and Systems Engineering ISE 330: Introduction to Operations Research - Deterministic Models Fall
More informationMixed Integer Programming Class Library (MIPCL)
Mixed Integer Programming Class Library (MIPCL) Nicolai N. Pisaruk Belarus State University, Faculty of Economy, Nezavisimosty Av., 4, 220088 Minsk, Belarus April 20, 2016 Abstract The Mixed Integer Programming
More informationA Lifted Linear Programming Branch-and-Bound Algorithm for Mixed Integer Conic Quadratic Programs
A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed Integer Conic Quadratic Programs Juan Pablo Vielma Shabbir Ahmed George L. Nemhauser H. Milton Stewart School of Industrial and Systems
More information56:272 Integer Programming & Network Flows Final Examination -- December 14, 1998
56:272 Integer Programming & Network Flows Final Examination -- December 14, 1998 Part A: Answer any four of the five problems. (15 points each) 1. Transportation problem 2. Integer LP Model Formulation
More informationOutline. Column Generation: Cutting Stock A very applied method. Introduction to Column Generation. Given an LP problem
Column Generation: Cutting Stock A very applied method thst@man.dtu.dk Outline History The Simplex algorithm (re-visited) Column Generation as an extension of the Simplex algorithm A simple example! DTU-Management
More informationColumn Generation: Cutting Stock
Column Generation: Cutting Stock A very applied method thst@man.dtu.dk DTU-Management Technical University of Denmark 1 Outline History The Simplex algorithm (re-visited) Column Generation as an extension
More information25. NLP algorithms. ˆ Overview. ˆ Local methods. ˆ Constrained optimization. ˆ Global methods. ˆ Black-box methods.
CS/ECE/ISyE 524 Introduction to Optimization Spring 2017 18 25. NLP algorithms ˆ Overview ˆ Local methods ˆ Constrained optimization ˆ Global methods ˆ Black-box methods ˆ Course wrap-up Laurent Lessard
More informationA List Heuristic for Vertex Cover
A List Heuristic for Vertex Cover Happy Birthday Vasek! David Avis McGill University Tomokazu Imamura Kyoto University Operations Research Letters (to appear) Online: http://cgm.cs.mcgill.ca/ avis revised:
More informationParallelizing the dual revised simplex method
Parallelizing the dual revised simplex method Qi Huangfu 1 Julian Hall 2 1 FICO 2 School of Mathematics, University of Edinburgh Birmingham 9 September 2016 Overview Background Two parallel schemes Single
More informationSolving Scenarios in the Cloud
Solving Scenarios in the Cloud Franz Nelißen FNelissen@gams.com GAMS Development Corp. GAMS Software GmbH www.gams.com GAMS - History Roots: World Bank, 1976 Alex Meerausfounded GAMS Development Corp.
More informationCutting Planes for Some Nonconvex Combinatorial Optimization Problems
Cutting Planes for Some Nonconvex Combinatorial Optimization Problems Ismael Regis de Farias Jr. Department of Industrial Engineering Texas Tech Summary Problem definition Solution strategy Multiple-choice
More informationSolving lexicographic multiobjective MIPs with Branch-Cut-Price
Solving lexicographic multiobjective MIPs with Branch-Cut-Price Marta Eso (The Hotchkiss School) Laszlo Ladanyi (IBM T.J. Watson Research Center) David Jensen (IBM T.J. Watson Research Center) McMaster
More informationTIM 206 Lecture Notes Integer Programming
TIM 206 Lecture Notes Integer Programming Instructor: Kevin Ross Scribe: Fengji Xu October 25, 2011 1 Defining Integer Programming Problems We will deal with linear constraints. The abbreviation MIP stands
More informationDepartment of Mathematics Oleg Burdakov of 30 October Consider the following linear programming problem (LP):
Linköping University Optimization TAOP3(0) Department of Mathematics Examination Oleg Burdakov of 30 October 03 Assignment Consider the following linear programming problem (LP): max z = x + x s.t. x x
More informationParallel Solvers for Mixed Integer Linear Programming
Zuse Institute Berlin Takustr. 7 14195 Berlin Germany TED RALPHS 1, YUJI SHINANO, TIMO BERTHOLD 2, THORSTEN KOCH Parallel Solvers for Mixed Integer Linear Programming 1 Department of Industrial and Systems
More informationImplementing a B&C algorithm for Mixed-Integer Bilevel Linear Programming
Implementing a B&C algorithm for Mixed-Integer Bilevel Linear Programming Matteo Fischetti, University of Padova 8th Cargese-Porquerolles Workshop on Combinatorial Optimization, August 2017 1 Bilevel Optimization
More information