The Fixed Charge Transportation Problem: A Strong Formulation Based On Lagrangian Decomposition and Column Generation
|
|
- Christian Strickland
- 6 years ago
- Views:
Transcription
1 The Fixed Charge Transportation Problem: A Strong Formulation Based On Lagrangian Decomposition and Column Generation Yixin Zhao, Torbjörn Larsson and Department of Mathematics, Linköping University, Sweden Column generation 2016
2 What is this talk about? Strong lower bounding for the fixed charge transportation problem by Lagrangian decomposition: supply and demand side copies of the shipping variables Dual cutting plane method (column generation)
3 What is this talk about? Strong lower bounding for the fixed charge transportation problem by Lagrangian decomposition: supply and demand side copies of the shipping variables Dual cutting plane method (column generation) Why? Lagrangian decomposition can give strong formulations Strong formulations of interest in column generation Combination not utilised in many papers Preliminary work to study the strength of the formulation: theoretically and empirically
4 Outline Introduction and background The fixed charge transportation problem Concluding comments
5 Lagrangian decomposition / Lagrangian relaxation Consider the problem (P) min{cx s.t. Ax b, Cx d, x X } = min{cx s.t. Ay b, Cx d, x = y, x X, y Y }, where Y is such that X Y
6 Lagrangian decomposition / Lagrangian relaxation Consider the problem (P) min{cx s.t. Ax b, Cx d, x X } = min{cx s.t. Ay b, Cx d, x = y, x X, y Y }, where Y is such that X Y Lagrangian decomposition (LD) min{cx + u(x y) s.t. Ay b, Cx d, x X, y Y } = min{(c + u)x s.t. Cx d, x X } + min{ uy s.t. Ay b, y Y }
7 Lagrangian decomposition / Lagrangian relaxation Consider the problem (P) min{cx s.t. Ax b, Cx d, x X } = min{cx s.t. Ay b, Cx d, x = y, x X, y Y }, where Y is such that X Y Lagrangian decomposition (LD) min{cx + u(x y) s.t. Ay b, Cx d, x X, y Y } = min{(c + u)x s.t. Cx d, x X } + min{ uy s.t. Ay b, y Y } Lagrangian relaxation w.r.t. one of the constraint groups, for example Ax b (LR) min{cx + v(ax b) s.t. Cx d, x X } = min{(c + va)x s.t. Cx d, x X } + vb, where v 0
8 Strength of bounds [Guignard and Kim(1987)]: The Lagrangian decomposition bound is as least as strong as the strongest of the Lagrangian relaxation bound when Ax b is relaxed the Lagrangian relaxation bound when Cx d is relaxed and there is a chance that it is stronger!
9 Related work Very few papers on Lagrangian decomposition and column generation: [Pimentel et al.(2010)]: The multi-item capacitated lot sizing problem Branch-and-price implementations for two types of Lagrangian relaxation and for Lagrangian decomposition Lagrangian decomposition: No gain in bound compared to Lagrangian relaxation when capacity is relaxed [Letocart et al.(2012)]: The 0-1 bi-dimensional knapsack problem and the generalised assignment problem Illustrates the concept No full comparison of bounds, conclusions not possible
10 Related work Very few papers on Lagrangian decomposition and column generation: [Pimentel et al.(2010)]: The multi-item capacitated lot sizing problem Branch-and-price implementations for two types of Lagrangian relaxation and for Lagrangian decomposition Lagrangian decomposition: No gain in bound compared to Lagrangian relaxation when capacity is relaxed [Letocart et al.(2012)]: The 0-1 bi-dimensional knapsack problem and the generalised assignment problem Illustrates the concept No full comparison of bounds, conclusions not possible Our work this far: Find an application where we gain in strength compared to the strongest obtainable from Lagrangian relaxation and investigate further...
11 Fixed charge transportation problem (FCTP) For each arc (i, j), i I, j J: u ij = min(s i, d j ) = upper bound c ij = unit cost for shipping f ij = fixed cost for shipping
12 Fixed charge transportation problem (FCTP) For each arc (i, j), i I, j J: u ij = min(s i, d j ) = upper bound c ij = unit cost for shipping f ij = fixed cost for shipping Variables: x ij = amount shipped from source i to sink j, i I, j J Concave cost function: g ij (x ij ) = { fij + c ij x ij if x ij > 0 0 if x ij = 0 i I, j J
13 Fixed charge transportation problem (FCTP) min s.t. g ij (x ij ) i I j J x ij = s i j J x ij = d j i I i I j J x ij 0 i I, j J Polytope of feasible solutions, minimisation of concave objective Optimal solution at an extreme point (can be non-global local optima at extreme points) MIP-formulation: A binary variable to indicate if there is flow on an arc or not
14 MIP-formulation of FCTP min s.t. ( ) cij x ij + f ij y ij i I j J x ij = s i j J x ij = d j i I x ij u ij y ij x ij 0 i I j J i I, j J i I, j J y ij {0, 1} i I, j J
15 The reformulation: variable splitting Supply and demand side duplicates of the shipping variables: xij s and xij d Introduce a parameter ν: 0 ν 1 min s.t. ν i I j J g ij (x s ij) + (1 ν) j J xij s = xij d i I, j J xij s = s i i I j J i I x d ij = d j j J x s ij, x d ij 0 i I, j J, i I g ij (x d ij )
16 The reformulation: inner representation Let each column correspond to an extreme point of a set X s i = {x s ij, j J j J x s ij = s i, 0 x s ij u ij, j J}, i I, or of a set X d j = {x d ij, i I i I x d ij = d j, 0 x d ij u ij, i I }, j J The flow from one source / to one sink is a convex combination of extreme point flows, introduce: λ s ip = convexity weight for extreme point p P s i and λ d jp = convexity weight for extreme point p P d j of set X s i, i I of set X d j, j J
17 The reformulation: column oriented formulation min s.t. ν i I p P s i j J g ij p P s i x s ijpλ s ip = λ s ip = 1 p P d j λ s ipxijp s x d ijpλ d jp i I + (1 ν) j J i I i I, j J g ij p P d j λ d jpxijp d p P s i λ d jp = 1 p P d j λ s ip 0 λ d jp 0 j J p P s i, i I p P d j, j J
18 The reformulation: approximating the objective The objective is bound below by its linearisation: ν g ij λ s ipx s ijp + (1 ν) g ij λ d jpx d ijp i I j J p P i s j J i I p P j d ν g ij (xijp) s λ s ip + (1 ν) g ij (xijp) d λ d jp i I j J j J i I p P s i p P d j What is lost by the linearisation?
19 The reformulation: arc cost True cost
20 The reformulation: arc cost True cost In LP-relaxation of MIP-formulation
21 The reformulation: arc cost True cost In LP-relaxation of MIP-formulation After our reformulation (here for supply side, similarly for sink side): Extreme points: true cost Non-extreme points: x s ij = p P s i : λs ip >0 xs ijp λs ip if x s ij > 0 and there is p P s i : λ s ip > 0 and xs ip = 0, then f ij is decreased by = p P s i : λs ip >0, xs ip =0 f ij λ s ip otherwise: true cost
22 The reformulation: arc cost True cost In LP-relaxation of MIP-formulation After our reformulation (here for supply side, similarly for sink side): Extreme points: true cost Non-extreme points: x s ij = p P s i : λs ip >0 xs ijp λs ip if x s ij > 0 and there is p P s i : λ s ip > 0 and xs ip = 0, then f ij is decreased by = p P s i : λs ip >0, xs ip =0 f ij λ s ip otherwise: true cost Example: For xij s = 4 = we have 3 x s ij1 = 6, λs i1 = 2 3 ; xs ij2 = 0, λs i2 = 1 3 ; = 1 3 f ij
23 The reformulation: column generation subproblem For a single source i I (and similarly for the sinks): ( ) min νg ij (xij) s α ij xij s β i s.t. j J j J x s ij = s i xij s u ij xij s 0 j J j J Concave minimization problem with an optimal solution at an extreme point of X s i MIP-formulation: Binary variable to indicate if there is flow on an arc or not
24 Theoretical strength [Guignard and Kim(1987)]: The Lagrangian decomposition bound (= convexification over source and sink side ) as least as strong as the strongest of the Lagrangian relaxation bound when Ax b is relaxed (= convexification over source side ) the Lagrangian relaxation bound when Cx d is relaxed (= convexification over sink side ) and there is a chance that it is stronger!
25 Theoretical strength: type of strength? The constraints in the MIP-formulation of the column generation subproblem (source side, similarly for the sink side): j J x s ij = s i x s ij u ij y s ij, j J y s ij {0, 1}, j J 0 x s ij, j J
26 Theoretical strength: type of strength? The constraints in the MIP-formulation of the column generation subproblem (source side, similarly for the sink side): j J x s ij = s i x s ij u ij y s ij, j J y s ij {0, 1}, j J 0 x s ij, j J Implied inequality: + u ij yij s s i j J
27 Theoretical strength: type of strength? The constraints in the MIP-formulation of the column generation subproblem (source side, similarly for the sink side): j J x s ij = s i x s ij u ij y s ij, j J y s ij {0, 1}, j J 0 x s ij, j J Implied inequality: + u ij yij s s i = j J Knapsack constraints over the binary variables At least (exactly?) that type of strength j J x s ij = s i xij s u ij yij, s j J u ij yij s s i j J y s ij {0, 1}, j J 0 x s ij, j J
28 Empirical strength Comparison: Convexification over both sides = Lagrangian decomposition Convexifiation over one side, see bounds obtained by [Roberti et al.(2015)] (A new formulation based on extreme flow patterns from each source; derive valid inequalities; exact branch and price; column generation to compute lower bounds)
29 Empirical strength Table: Instance characteristics instance total r. v. c. r. f. c. type ID size supply inf sup inf sup Roberti-set3 Table5-(1-10) Roberti-set3 Table6-(1-10) Roberti-set3 Table7-(1-10) r.v.c. = range of variable costs; r.f.c. = range of fixed costs Compare LBDs by comparing gaps (relative deviations) calculated as (UBD-LBD)/LBD in percent The UBDs used are the best known, most of them are verified to be optimal
30 Empirical strength instance cost gap (%) ID ratio (%) FCTP-LP Roberti et al. our Table Table Table Table Table Table Table Table Table Table AVG instance cost gap (%) ID ratio (%) FCTP-LP Roberti et al. our Table Table Table Table Table Table Table Table Table Table AVG instance cost gap (%) ID ratio (%) FCTP-LP Roberti et al. our Table Table Table Table Table Table Table Table Table Table AVG Average improvement in gap thanks to convexification, from first side + from second side Table5: 47% + 46% Table6: 43% + 45% Table7: 42% + 37% Both convexifications contribute!
31 Other observations this far Property of the dual function: Constant along the direction e Stabilsation: No improvement the opposite! Because of the property of the dual function: Tried regularisation instead to favour solutions with a small l 1 -norm
32 Conclusions this far: Strong formulation for the fixed charge transportation problem Empirically we gain significantly in strength from the convexification over both sides Further studies: Properties of the dual function, cf. experiences from subgradient methods? Understand the effects of stabilization. Customized techniques? How strength depends on instance characteristics
33 Bibliography Guignard M, Kim S (1987) Lagrangean decomposition: a model yielding stronger lagrangean bounds. Mathematical Programming 39 (2): Letocart L, Nagih A, Touati-Moungla N (2012) Dantzig-Wolfe and Lagrangian decompositions in integer linear programming. International Journal of Mathematics in Operational Research 4(3): Pimentel CMO, Alvelos FP, de Carvalho JMV (2010) Comparing Dantzig-Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem. Optimization Methods and Software 25(2): Roberti R, Bartolini E, Mingozzi A (2015) The fixed charge transportation problem: an exact algorithm based on a new integer programming formulation. Management Science, forthcoming. Thanks for listening!
Extended Formulations, Lagrangian Relaxation, & Column Generation: tackling large scale applications
Extended Formulations, Lagrangian Relaxation, & Column Generation: tackling large scale applications François Vanderbeck University of Bordeaux INRIA Bordeaux-Sud-Ouest part : Defining Extended Formulations
More informationNetwork Flows. 6. Lagrangian Relaxation. Programming. Fall 2010 Instructor: Dr. Masoud Yaghini
In the name of God Network Flows 6. Lagrangian Relaxation 6.3 Lagrangian Relaxation and Integer Programming Fall 2010 Instructor: Dr. Masoud Yaghini Integer Programming Outline Branch-and-Bound Technique
More informationOutline. Relaxation. Outline DMP204 SCHEDULING, TIMETABLING AND ROUTING. 1. Lagrangian Relaxation. Lecture 12 Single Machine Models, Column Generation
Outline DMP204 SCHEDULING, TIMETABLING AND ROUTING 1. Lagrangian Relaxation Lecture 12 Single Machine Models, Column Generation 2. Dantzig-Wolfe Decomposition Dantzig-Wolfe Decomposition Delayed Column
More informationLagrangian Relaxation in MIP
Lagrangian Relaxation in MIP Bernard Gendron May 28, 2016 Master Class on Decomposition, CPAIOR2016, Banff, Canada CIRRELT and Département d informatique et de recherche opérationnelle, Université de Montréal,
More informationLecture 7: Lagrangian Relaxation and Duality Theory
Lecture 7: Lagrangian Relaxation and Duality Theory (3 units) Outline Lagrangian dual for linear IP Lagrangian dual for general IP Dual Search Lagrangian decomposition 1 / 23 Joseph Louis Lagrange Joseph
More informationLecture 9: Dantzig-Wolfe Decomposition
Lecture 9: Dantzig-Wolfe Decomposition (3 units) Outline Dantzig-Wolfe decomposition Column generation algorithm Relation to Lagrangian dual Branch-and-price method Generated assignment problem and multi-commodity
More informationInteger program reformulation for robust branch-and-cut-and-price
Integer program reformulation for robust branch-and-cut-and-price Marcus Poggi de Aragão Informática PUC-Rio Eduardo Uchoa Engenharia de Produção Universidade Federal Fluminense Outline of the talk Robust
More informationInteger Programming ISE 418. Lecture 16. Dr. Ted Ralphs
Integer Programming ISE 418 Lecture 16 Dr. Ted Ralphs ISE 418 Lecture 16 1 Reading for This Lecture Wolsey, Chapters 10 and 11 Nemhauser and Wolsey Sections II.3.1, II.3.6, II.3.7, II.5.4 CCZ Chapter 8
More informationDecomposition-based Methods for Large-scale Discrete Optimization p.1
Decomposition-based Methods for Large-scale Discrete Optimization Matthew V Galati Ted K Ralphs Department of Industrial and Systems Engineering Lehigh University, Bethlehem, PA, USA Départment de Mathématiques
More informationDecomposition and Reformulation in Integer Programming
and Reformulation in Integer Programming Laurence A. WOLSEY 7/1/2008 / Aussois and Reformulation in Integer Programming Outline 1 Resource 2 and Reformulation in Integer Programming Outline Resource 1
More informationLecture 8: Column Generation
Lecture 8: Column Generation (3 units) Outline Cutting stock problem Classical IP formulation Set covering formulation Column generation A dual perspective 1 / 24 Cutting stock problem 2 / 24 Problem description
More informationInteger Programming Reformulations: Dantzig-Wolfe & Benders Decomposition the Coluna Software Platform
Integer Programming Reformulations: Dantzig-Wolfe & Benders Decomposition the Coluna Software Platform François Vanderbeck B. Detienne, F. Clautiaux, R. Griset, T. Leite, G. Marques, V. Nesello, A. Pessoa,
More informationBranch-and-Price-and-Cut for the Split Delivery Vehicle Routing Problem with Time Windows
Branch-and-Price-and-Cut for the Split Delivery Vehicle Routing Problem with Time Windows Guy Desaulniers École Polytechnique de Montréal and GERAD Column Generation 2008 Aussois, France Outline Introduction
More informationColumn Generation for Extended Formulations
1 / 28 Column Generation for Extended Formulations Ruslan Sadykov 1 François Vanderbeck 2,1 1 INRIA Bordeaux Sud-Ouest, France 2 University Bordeaux I, France ISMP 2012 Berlin, August 23 2 / 28 Contents
More informationDecomposition Methods for Integer Programming
Decomposition Methods for Integer Programming J.M. Valério de Carvalho vc@dps.uminho.pt Departamento de Produção e Sistemas Escola de Engenharia, Universidade do Minho Portugal PhD Course Programa Doutoral
More informationClassification of Dantzig-Wolfe Reformulations for MIP s
Classification of Dantzig-Wolfe Reformulations for MIP s Raf Jans Rotterdam School of Management HEC Montreal Workshop on Column Generation Aussois, June 2008 Outline and Motivation Dantzig-Wolfe reformulation
More informationFixed-charge transportation problems on trees
Fixed-charge transportation problems on trees Gustavo Angulo * Mathieu Van Vyve * gustavo.angulo@uclouvain.be mathieu.vanvyve@uclouvain.be November 23, 2015 Abstract We consider a class of fixed-charge
More informationInterior-Point versus Simplex methods for Integer Programming Branch-and-Bound
Interior-Point versus Simplex methods for Integer Programming Branch-and-Bound Samir Elhedhli elhedhli@uwaterloo.ca Department of Management Sciences, University of Waterloo, Canada Page of 4 McMaster
More information0-1 Reformulations of the Network Loading Problem
0-1 Reformulations of the Network Loading Problem Antonio Frangioni 1 frangio@di.unipi.it Bernard Gendron 2 bernard@crt.umontreal.ca 1 Dipartimento di Informatica Università di Pisa Via Buonarroti, 2 56127
More informationWhat is an integer program? Modelling with Integer Variables. Mixed Integer Program. Let us start with a linear program: max cx s.t.
Modelling with Integer Variables jesla@mandtudk Department of Management Engineering Technical University of Denmark What is an integer program? Let us start with a linear program: st Ax b x 0 where A
More informationLecture 8: Column Generation
Lecture 8: Column Generation (3 units) Outline Cutting stock problem Classical IP formulation Set covering formulation Column generation A dual perspective Vehicle routing problem 1 / 33 Cutting stock
More informationColumn generation for extended formulations
EURO J Comput Optim (2013) 1:81 115 DOI 10.1007/s13675-013-0009-9 ORIGINAL PAPER Column generation for extended formulations Ruslan Sadykov François Vanderbeck Received: 5 May 2012 / Accepted: 21 December
More informationColumn Generation. ORLAB - Operations Research Laboratory. Stefano Gualandi. June 14, Politecnico di Milano, Italy
ORLAB - Operations Research Laboratory Politecnico di Milano, Italy June 14, 2011 Cutting Stock Problem (from wikipedia) Imagine that you work in a paper mill and you have a number of rolls of paper of
More information4y Springer NONLINEAR INTEGER PROGRAMMING
NONLINEAR INTEGER PROGRAMMING DUAN LI Department of Systems Engineering and Engineering Management The Chinese University of Hong Kong Shatin, N. T. Hong Kong XIAOLING SUN Department of Mathematics Shanghai
More informationVehicle Routing and MIP
CORE, Université Catholique de Louvain 5th Porto Meeting on Mathematics for Industry, 11th April 2014 Contents: The Capacitated Vehicle Routing Problem Subproblems: Trees and the TSP CVRP Cutting Planes
More informationInteger Programming ISE 418. Lecture 8. Dr. Ted Ralphs
Integer Programming ISE 418 Lecture 8 Dr. Ted Ralphs ISE 418 Lecture 8 1 Reading for This Lecture Wolsey Chapter 2 Nemhauser and Wolsey Sections II.3.1, II.3.6, II.4.1, II.4.2, II.5.4 Duality for Mixed-Integer
More informationComputational Integer Programming. Lecture 2: Modeling and Formulation. Dr. Ted Ralphs
Computational Integer Programming Lecture 2: Modeling and Formulation Dr. Ted Ralphs Computational MILP Lecture 2 1 Reading for This Lecture N&W Sections I.1.1-I.1.6 Wolsey Chapter 1 CCZ Chapter 2 Computational
More informationReformulation and Decomposition of Integer Programs
Reformulation and Decomposition of Integer Programs François Vanderbeck 1 and Laurence A. Wolsey 2 (Reference: CORE DP 2009/16) (1) Université Bordeaux 1 & INRIA-Bordeaux (2) Université de Louvain, CORE.
More informationOperations Research Lecture 6: Integer Programming
Operations Research Lecture 6: Integer Programming Notes taken by Kaiquan Xu@Business School, Nanjing University May 12th 2016 1 Integer programming (IP) formulations The integer programming (IP) is the
More informationA Capacity Scaling Procedure for the Multi-Commodity Capacitated Network Design Problem. Ryutsu Keizai University Naoto KATAYAMA
A Capacity Scaling Procedure for the Multi-Commodity Capacitated Network Design Problem Ryutsu Keizai University Naoto KATAYAMA Problems 2006 1 Multi-Commodity Network Design Problem The basic model for
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 informationAdvanced linear programming
Advanced linear programming http://www.staff.science.uu.nl/~akker103/alp/ Chapter 10: Integer linear programming models Marjan van den Akker 1 Intro. Marjan van den Akker Master Mathematics TU/e PhD Mathematics
More informationLarge-scale optimization and decomposition methods: outline. Column Generation and Cutting Plane methods: a unified view
Large-scale optimization and decomposition methods: outline I Solution approaches for large-scaled problems: I Delayed column generation I Cutting plane methods (delayed constraint generation) 7 I Problems
More information3.4 Relaxations and bounds
3.4 Relaxations and bounds Consider a generic Discrete Optimization problem z = min{c(x) : x X} with an optimal solution x X. In general, the algorithms generate not only a decreasing sequence of upper
More informationMVE165/MMG631 Linear and integer optimization with applications Lecture 8 Discrete optimization: theory and algorithms
MVE165/MMG631 Linear and integer optimization with applications Lecture 8 Discrete optimization: theory and algorithms Ann-Brith Strömberg 2017 04 07 Lecture 8 Linear and integer optimization with applications
More informationA Node-Flow Model for 1D Stock Cutting: Robust Branch-Cut-and-Price
A Node-Flow Model for 1D Stock Cutting: Robust Branch-Cut-and-Price Gleb Belov University of Dresden Adam N. Letchford Lancaster University Eduardo Uchoa Universidade Federal Fluminense August 4, 2011
More informationDiscrete lot sizing and scheduling on parallel machines: description of a column generation approach
126 IO 2013 XVI Congresso da Associação Portuguesa de Investigação Operacional Discrete lot sizing and scheduling on parallel machines: description of a column generation approach António J.S.T. Duarte,
More informationIntroduction to Bin Packing Problems
Introduction to Bin Packing Problems Fabio Furini March 13, 2015 Outline Origins and applications Applications: Definition: Bin Packing Problem (BPP) Solution techniques for the BPP Heuristic Algorithms
More informationStabilization in Column Generation: numerical study
1 / 26 Stabilization in Column Generation: numerical study Artur Pessoa 3 Ruslan Sadykov 1,2 Eduardo Uchoa 3 François Vanderbeck 2,1 1 INRIA Bordeaux, France 2 Univ. Bordeaux I, France 3 Universidade Federal
More information15.081J/6.251J Introduction to Mathematical Programming. Lecture 24: Discrete Optimization
15.081J/6.251J Introduction to Mathematical Programming Lecture 24: Discrete Optimization 1 Outline Modeling with integer variables Slide 1 What is a good formulation? Theme: The Power of Formulations
More informationA column generation approach to the discrete lot sizing and scheduling problem on parallel machines
A column generation approach to the discrete lot sizing and scheduling problem on parallel machines António J.S.T. Duarte and J.M.V. Valério de Carvalho Abstract In this work, we study the discrete lot
More informationColumn Generation. MTech Seminar Report. Soumitra Pal Roll No: under the guidance of
Column Generation MTech Seminar Report by Soumitra Pal Roll No: 05305015 under the guidance of Prof. A. G. Ranade Computer Science and Engineering IIT-Bombay a Department of Computer Science and Engineering
More informationStrengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse
Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse Merve Bodur 1, Sanjeeb Dash 2, Otay Günlü 2, and James Luedte 3 1 Department of Mechanical and Industrial Engineering,
More informationIn the original knapsack problem, the value of the contents of the knapsack is maximized subject to a single capacity constraint, for example weight.
In the original knapsack problem, the value of the contents of the knapsack is maximized subject to a single capacity constraint, for example weight. In the multi-dimensional knapsack problem, additional
More informationPART 4 INTEGER PROGRAMMING
PART 4 INTEGER PROGRAMMING 102 Read Chapters 11 and 12 in textbook 103 A capital budgeting problem We want to invest $19 000 Four investment opportunities which cannot be split (take it or leave it) 1.
More informationInteger Program Reformulation for Robust. Branch-and-Cut-and-Price Algorithms
Integer Program Reformulation for Robust Branch-and-Cut-and-Price Algorithms Marcus Poggi de Aragão 1, Eduardo Uchoa 2 1 Departamento de Informática, PUC-Rio, poggi@inf.puc-rio.br 2 Dep. de Engenharia
More informationSolving LP and MIP Models with Piecewise Linear Objective Functions
Solving LP and MIP Models with Piecewise Linear Obective Functions Zonghao Gu Gurobi Optimization Inc. Columbus, July 23, 2014 Overview } Introduction } Piecewise linear (PWL) function Convex and convex
More informationNotes on Dantzig-Wolfe decomposition and column generation
Notes on Dantzig-Wolfe decomposition and column generation Mette Gamst November 11, 2010 1 Introduction This note introduces an exact solution method for mathematical programming problems. The method is
More information3.10 Lagrangian relaxation
3.10 Lagrangian relaxation Consider a generic ILP problem min {c t x : Ax b, Dx d, x Z n } with integer coefficients. Suppose Dx d are the complicating constraints. Often the linear relaxation and the
More informationSemidefinite Programming Basics and Applications
Semidefinite Programming Basics and Applications Ray Pörn, principal lecturer Åbo Akademi University Novia University of Applied Sciences Content What is semidefinite programming (SDP)? How to represent
More informationInteger programming: an introduction. Alessandro Astolfi
Integer programming: an introduction Alessandro Astolfi Outline Introduction Examples Methods for solving ILP Optimization on graphs LP problems with integer solutions Summary Introduction Integer programming
More informationSemi-Infinite Relaxations for a Dynamic Knapsack Problem
Semi-Infinite Relaxations for a Dynamic Knapsack Problem Alejandro Toriello joint with Daniel Blado, Weihong Hu Stewart School of Industrial and Systems Engineering Georgia Institute of Technology MIT
More informationQuadratic reformulation techniques for 0-1 quadratic programs
OSE SEMINAR 2014 Quadratic reformulation techniques for 0-1 quadratic programs Ray Pörn CENTER OF EXCELLENCE IN OPTIMIZATION AND SYSTEMS ENGINEERING ÅBO AKADEMI UNIVERSITY ÅBO NOVEMBER 14th 2014 2 Structure
More informationIntroduction to Integer Programming
Lecture 3/3/2006 p. /27 Introduction to Integer Programming Leo Liberti LIX, École Polytechnique liberti@lix.polytechnique.fr Lecture 3/3/2006 p. 2/27 Contents IP formulations and examples Total unimodularity
More informationConvexification of Mixed-Integer Quadratically Constrained Quadratic Programs
Convexification of Mixed-Integer Quadratically Constrained Quadratic Programs Laura Galli 1 Adam N. Letchford 2 Lancaster, April 2011 1 DEIS, University of Bologna, Italy 2 Department of Management Science,
More informationA generic view of Dantzig Wolfe decomposition in mixed integer programming
Operations Research Letters 34 (2006) 296 306 Operations Research Letters www.elsevier.com/locate/orl A generic view of Dantzig Wolfe decomposition in mixed integer programming François Vanderbeck a,,
More informationApplied Lagrange Duality for Constrained Optimization
Applied Lagrange Duality for Constrained Optimization February 12, 2002 Overview The Practical Importance of Duality ffl Review of Convexity ffl A Separating Hyperplane Theorem ffl Definition of the Dual
More informationLagrange Relaxation: Introduction and Applications
1 / 23 Lagrange Relaxation: Introduction and Applications Operations Research Anthony Papavasiliou 2 / 23 Contents 1 Context 2 Applications Application in Stochastic Programming Unit Commitment 3 / 23
More informationDual Decomposition.
1/34 Dual Decomposition http://bicmr.pku.edu.cn/~wenzw/opt-2017-fall.html Acknowledgement: this slides is based on Prof. Lieven Vandenberghes lecture notes Outline 2/34 1 Conjugate function 2 introduction:
More informationStochastic Integer Programming An Algorithmic Perspective
Stochastic Integer Programming An Algorithmic Perspective sahmed@isye.gatech.edu www.isye.gatech.edu/~sahmed School of Industrial & Systems Engineering 2 Outline Two-stage SIP Formulation Challenges Simple
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 informationColumn Generation. i = 1,, 255;
Column Generation The idea of the column generation can be motivated by the trim-loss problem: We receive an order to cut 50 pieces of.5-meter (pipe) segments, 250 pieces of 2-meter segments, and 200 pieces
More informationAn Integrated Approach to Truss Structure Design
Slide 1 An Integrated Approach to Truss Structure Design J. N. Hooker Tallys Yunes CPAIOR Workshop on Hybrid Methods for Nonlinear Combinatorial Problems Bologna, June 2010 How to Solve Nonlinear Combinatorial
More informationOn the exact solution of a large class of parallel machine scheduling problems
1 / 23 On the exact solution of a large class of parallel machine scheduling problems Teobaldo Bulhões 2 Ruslan Sadykov 1 Eduardo Uchoa 2 Anand Subramanian 3 1 Inria Bordeaux and Univ. Bordeaux, France
More information1 Column Generation and the Cutting Stock Problem
1 Column Generation and the Cutting Stock Problem In the linear programming approach to the traveling salesman problem we used the cutting plane approach. The cutting plane approach is appropriate when
More informationIntroduction to Integer Linear Programming
Lecture 7/12/2006 p. 1/30 Introduction to Integer Linear Programming Leo Liberti, Ruslan Sadykov LIX, École Polytechnique liberti@lix.polytechnique.fr sadykov@lix.polytechnique.fr Lecture 7/12/2006 p.
More informationStabilized Branch-and-cut-and-price for the Generalized Assignment Problem
Stabilized Branch-and-cut-and-price for the Generalized Assignment Problem Alexandre Pigatti, Marcus Poggi de Aragão Departamento de Informática, PUC do Rio de Janeiro {apigatti, poggi}@inf.puc-rio.br
More informationDevelopment of the new MINLP Solver Decogo using SCIP - Status Report
Development of the new MINLP Solver Decogo using SCIP - Status Report Pavlo Muts with Norman Breitfeld, Vitali Gintner, Ivo Nowak SCIP Workshop 2018, Aachen Table of contents 1. Introduction 2. Automatic
More informationLagrange duality. The Lagrangian. We consider an optimization program of the form
Lagrange duality Another way to arrive at the KKT conditions, and one which gives us some insight on solving constrained optimization problems, is through the Lagrange dual. The dual is a maximization
More informationLocal Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems
Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems Kerem Akartunalı Dept. of Management Science, University of Strathclyde, Glasgow, G1 1QE, UK, kerem.akartunali@strath.ac.uk
More informationand to estimate the quality of feasible solutions I A new way to derive dual bounds:
Lagrangian Relaxations and Duality I Recall: I Relaxations provide dual bounds for the problem I So do feasible solutions of dual problems I Having tight dual bounds is important in algorithms (B&B), and
More informationKNAPSACK PROBLEMS WITH SETUPS
7 e Conférence Francophone de MOdélisation et SIMulation - MOSIM 08 - du 31 mars au 2 avril 2008 - Paris - France Modélisation, Optimisation et Simulation des Systèmes : Communication, Coopération et Coordination
More informationNonlinear Programming
Nonlinear Programming Kees Roos e-mail: C.Roos@ewi.tudelft.nl URL: http://www.isa.ewi.tudelft.nl/ roos LNMB Course De Uithof, Utrecht February 6 - May 8, A.D. 2006 Optimization Group 1 Outline for week
More informationLinear integer programming and its application
Linear integer programming and its application Presented by Dr. Sasthi C. Ghosh Associate Professor Advanced Computing & Microelectronics Unit Indian Statistical Institute Kolkata, India Outline Introduction
More informationThe fire and rescue vehicle location problem
The fire and rescue vehicle location problem Henrik Andersson Norwegian University of Science and Technology Tobias Andersson Granberg Linköping University Introduction The Swedish Civil Contingencies
More informationto work with) can be solved by solving their LP relaxations with the Simplex method I Cutting plane algorithms, e.g., Gomory s fractional cutting
Summary so far z =max{c T x : Ax apple b, x 2 Z n +} I Modeling with IP (and MIP, and BIP) problems I Formulation for a discrete set that is a feasible region of an IP I Alternative formulations for the
More informationAcyclic Semidefinite Approximations of Quadratically Constrained Quadratic Programs
Acyclic Semidefinite Approximations of Quadratically Constrained Quadratic Programs Raphael Louca & Eilyan Bitar School of Electrical and Computer Engineering American Control Conference (ACC) Chicago,
More informationOptimization for Communications and Networks. Poompat Saengudomlert. Session 4 Duality and Lagrange Multipliers
Optimization for Communications and Networks Poompat Saengudomlert Session 4 Duality and Lagrange Multipliers P Saengudomlert (2015) Optimization Session 4 1 / 14 24 Dual Problems Consider a primal convex
More informationValid Inequalities for Optimal Transmission Switching
Valid Inequalities for Optimal Transmission Switching Hyemin Jeon Jeff Linderoth Jim Luedtke Dept. of ISyE UW-Madison Burak Kocuk Santanu Dey Andy Sun Dept. of ISyE Georgia Tech 19th Combinatorial Optimization
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 informationConvex Optimization and Support Vector Machine
Convex Optimization and Support Vector Machine Problem 0. Consider a two-class classification problem. The training data is L n = {(x 1, t 1 ),..., (x n, t n )}, where each t i { 1, 1} and x i R p. We
More informationLecture 10: Linear programming duality and sensitivity 0-0
Lecture 10: Linear programming duality and sensitivity 0-0 The canonical primal dual pair 1 A R m n, b R m, and c R n maximize z = c T x (1) subject to Ax b, x 0 n and minimize w = b T y (2) subject to
More informationA Column Generation Based Heuristic for the Dial-A-Ride Problem
A Column Generation Based Heuristic for the Dial-A-Ride Problem Nastaran Rahmani 1, Boris Detienne 2,3, Ruslan Sadykov 3,2, François Vanderbeck 2,3 1 Kedge Business School, 680 Cours de la Libération,
More informationMulticommodity Flows and Column Generation
Lecture Notes Multicommodity Flows and Column Generation Marc Pfetsch Zuse Institute Berlin pfetsch@zib.de last change: 2/8/2006 Technische Universität Berlin Fakultät II, Institut für Mathematik WS 2006/07
More informationAcceleration and Stabilization Techniques for Column Generation
Acceleration and Stabilization Techniques for Column Generation Zhouchun Huang Qipeng Phil Zheng Department of Industrial Engineering & Management Systems University of Central Florida Sep 26, 2014 Outline
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 informationAn Integer Cutting-Plane Procedure for the Dantzig-Wolfe Decomposition: Theory
An Integer Cutting-Plane Procedure for the Dantzig-Wolfe Decomposition: Theory by Troels Martin Range Discussion Papers on Business and Economics No. 10/2006 FURTHER INFORMATION Department of Business
More information15-850: Advanced Algorithms CMU, Fall 2018 HW #4 (out October 17, 2018) Due: October 28, 2018
15-850: Advanced Algorithms CMU, Fall 2018 HW #4 (out October 17, 2018) Due: October 28, 2018 Usual rules. :) Exercises 1. Lots of Flows. Suppose you wanted to find an approximate solution to the following
More informationSection Notes 8. Integer Programming II. Applied Math 121. Week of April 5, expand your knowledge of big M s and logical constraints.
Section Notes 8 Integer Programming II Applied Math 121 Week of April 5, 2010 Goals for the week understand IP relaxations be able to determine the relative strength of formulations understand the branch
More informationSeparation Techniques for Constrained Nonlinear 0 1 Programming
Separation Techniques for Constrained Nonlinear 0 1 Programming Christoph Buchheim Computer Science Department, University of Cologne and DEIS, University of Bologna MIP 2008, Columbia University, New
More informationA maritime version of the Travelling Salesman Problem
A maritime version of the Travelling Salesman Problem Enrico Malaguti, Silvano Martello, Alberto Santini May 31, 2015 Plan 1 The Capacitated TSP with Pickup and Delivery 2 The TSPPD with Draught Limits
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 informationBilevel Integer Programming
Bilevel Integer Programming Ted Ralphs 1 Joint work with: Scott DeNegre 1, Menal Guzelsoy 1 COR@L Lab, Department of Industrial and Systems Engineering, Lehigh University Norfolk Southern Ralphs, et al.
More informationICS-E4030 Kernel Methods in Machine Learning
ICS-E4030 Kernel Methods in Machine Learning Lecture 3: Convex optimization and duality Juho Rousu 28. September, 2016 Juho Rousu 28. September, 2016 1 / 38 Convex optimization Convex optimisation This
More informationDiscrete Optimization 2010 Lecture 7 Introduction to Integer Programming
Discrete Optimization 2010 Lecture 7 Introduction to Integer Programming Marc Uetz University of Twente m.uetz@utwente.nl Lecture 8: sheet 1 / 32 Marc Uetz Discrete Optimization Outline 1 Intro: The Matching
More informationA Hub Location Problem with Fully Interconnected Backbone and Access Networks
A Hub Location Problem with Fully Interconnected Backbone and Access Networks Tommy Thomadsen Informatics and Mathematical Modelling Technical University of Denmark 2800 Kgs. Lyngby Denmark tt@imm.dtu.dk
More informationCAPACITATED LOT-SIZING PROBLEM WITH SETUP TIMES, STOCK AND DEMAND SHORTAGES
CAPACITATED LOT-SIZING PROBLEM WITH SETUP TIMES, STOCK AND DEMAND SHORTAGES Nabil Absi,1 Safia Kedad-Sidhoum Laboratoire d Informatique d Avignon, 339 chemin des Meinajariès, 84911 Avignon Cedex 09, France
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 informationHW1 solutions. 1. α Ef(x) β, where Ef(x) is the expected value of f(x), i.e., Ef(x) = n. i=1 p if(a i ). (The function f : R R is given.
HW1 solutions Exercise 1 (Some sets of probability distributions.) Let x be a real-valued random variable with Prob(x = a i ) = p i, i = 1,..., n, where a 1 < a 2 < < a n. Of course p R n lies in the standard
More information- Well-characterized problems, min-max relations, approximate certificates. - LP problems in the standard form, primal and dual linear programs
LP-Duality ( Approximation Algorithms by V. Vazirani, Chapter 12) - Well-characterized problems, min-max relations, approximate certificates - LP problems in the standard form, primal and dual linear programs
More information