# 3 INTEGER LINEAR PROGRAMMING

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 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= 1 b i for i=1,...,m for j=1,...,n for j I Matrix form: s.t. min c T x Ax b x 0 x j integer for j I

2 Variations: The objective may be maximization. Constraints may be of type b i, b i, or =b i. Variables need not be nonnegative. The problem can always be brought in the above normal form. Without integer requirement, I = O/ a linear programming problem LP. Solution algorithms for LP: 1) Simplex algorithm (worst case exponential, experimentally average case polynomial) 2) Karmarkar's Interior Point Method (polynomial)

3 Subcategories: Pure integer programming problem: I = {1,...,n} Mixed integer (linear) programming problem MIP (MILP): some of the variables are continuous, some integer. Binary integer programming problem (BIP): x i {0,1}, i=1,...,n. All of these are NP-complete: ILP, MIP, BIP,... NPC.

4 LP-relaxation = ILP without integer requirements Why linear models? The LP-relaxation of linear IP-models can be solved efficiently and this solution can be used as a starting point for integer solutions. Many (most) combinatorial optimization problems can be modeled as ILP-models. Problems with nonlinear objective or constraint functions are uncommon in combinatorial optimization.

5 Applications of ILP-models: - standard graph, routing, packing and scheduling problems of discrete optimization Examples (1)-(14) in Chapter LP problems in which the variables are numbers of whole pieces. - LP problems with logical constraints (disjunction, implication etc.), fixed costs

6 A simple heuristic: Solve the LP-relaxation and round the variables x j, j I to the nearest integer. Improvement: Try all rounding possibilities. This technique is suitable only for instances with few integer variables or when their order of magnitude is large enough. Problems: - The rounded solution is not necessarily optimal or may be far from the optimum. - The rounded solution may not be feasible. - If the number of integer variables is k, the number of different rounding combinations is 2 k. Exponential time, if feasibility has to be checked for all. - Binary variables: no realistic interpretation for fractional values. For example Knapsack problem: x i = 0.5: gives no information of the decision: to take the object or not? The rounding corresponds to a flip of a coin.

7 BRANCH AND BOUND METHODS The advantage of a unique model: a general purpose Branch and Bound method. Two basic stages of a general Branch and Bound method: Branching: splitting the problem into subproblems Bounding: calculating lower and/or upper bounds for the objective function value of the subproblem Example of branching: separating the current subspace into two parts using the integrality requirement. Using the bounds, unpromising subproblems can be eliminated.

8 LP-relaxation: - discarding the integer requirements. - for binary variables, add bounds 0 x i 1 The LP-minimum gives a lower bound for the ILP-minimum: min f LP min f ILP. Incumbent solution = the best IP-solution given by the solved subproblems (record holder). The incumbent objective value is an upper bound for the minimum value.

9 A list P of candidate subproblems is maintained and updated. Subproblem is fathomed (totally solved, examined, explored) and removed from the list, when it has an integer solution that is best so far and becomes the new incumbent solution, or, its optimum LP-solution objective is worse than the current incumbent value, or, the LP-problem is infeasible. Notation: f* = minimum value of the objective function for the current LP-subproblem f min = incumbent minimum value, given by a feasible integer solution x min P = the set of non-fathomed subproblems

10 BRANCH AND BOUND ALGORITHM: 0. f min := or known f value at a feasible integer solution, P := O/ Solve the LP-relaxation: solution x, f* = f(x). Stop, if x satisfies integrality constraints: it is the optimum solution. the problem is infeasible or unbounded. 1. Branching: Select a variable x j, j I that has a fractional value: k < x j < k+1 (k integer) Create two new LP-subproblems and add these to the set P: 1) previous LP-subproblem + constraint x j k 2) previous LP-subproblem + constraint x j k+1

11 2. Select a subproblem from set P and solve it. Remove it from set P. 3. (a) If f* < f min, but x does not satisfy integrality constraints, go to 1 (branching). FATHOMING: (b) Bounding: If f* < f min and x satisfies integrality constraints, set f min := f* and x min := x. Go to 4. (c) If f* f min, go to 4. (d) If the subproblem is infeasible, go to 4.

12 4. If there are unsolved subproblems (P O/ ), go to 2. Else (P=O/ ), stop: all problems are fathomed. If f min =, the problem has no integer solution. Else, the solution is x min, f min.

13 The LP-subproblems vertices of a binary tree Every vertex has either - two descendants: case 3(a), or - none, when it is fathomed: cases 3(b),(c),(d) Modifications for maximization: Replace f min, x min with f max, x max. Replace with - in steps 1 and 4. Reverse inequalities in step 3.

14 Specifications: 1) How to select a branching variable? No absolutely best branching strategy. Heuristic rules: Select the variable - with a value closest to integer - with the largest coefficient in the objective function

15 2) How to select the next LP-subproblem to be solved? Backtracking / Depth-first / LIFO: Solve the subproblems in the reverse order of generation (Last In, First Out): take the sub-problem that was generated last (one of the two) to be solved first. Proceed to its descendant until the branch has been fathomed. Jumptracking: Solve the subproblems of step 1 immediately after branching and execute step 3. In this case P = {the subproblems waiting for branching}. Select the problem with best f*-value for branching.

16 Example 3.1 min f = 4x 1 + 5x 2 x 1 + 4x 2 5 3x 1 + 2x 2 7 x 1, x 2 0, both integer.

17 Branch-and-Bound tree of subproblems:

18 Comment: The descendant LP-subproblem differ from its parent LP-problem only by one constraint Use dual simplex method, starting from the basic solution of its parent LP. The above Branch & Bound can be used for pure ILP:s, mixed ILP:s and binary problems. For binary variables the branching constraints x i 0 and x i 1 result in values x i =0 and x i =1. Implicit enumeration techniques like Balas' additive algorithm may be computationally more efficient for binary problems. Specialized implementations of the B&B method exist for common problem types of Chapter 1.3 e.g. TSP or scheduling.

19 General goals of all Branch & Bound methods: to determine the bounds as tight as possible efficient fathoming of subproblems = pruning of nonpromising branches to keep the total computation time at minimum The last goal in conflict with the first two: tight bounds mean efficient fathoming but more computation per vertex.

20 CUTTING PLANE METHODS Consider a pure integer linear programming problem, where all parameters are integers. This can be accomplished by multiplying a constraint by a suitable constant. Objective function value and all the "slack" variables have integer values (in a feasible solution). First, solve the LP-relaxation to get a lower bound for the minimum objective value.

21 Final simplex tableau given: basic variables have columns with coefficient 1 in one constraint row and 0 in other rows. Solution: nonbasic variables = 0 basic varibles = RHS (right hand side) The objective function of the same form, basic variable f. If the LP-solution is fractional, at least one of the RHS values is fractional. Append to the model a constraint that cuts away a part of the feasible set, so that no integer solutions are lost.

22 Consider row i from the final simplex tableau, with a fractional RHS d. x jo = the basic variable of this row N = index set of nonbasic variables. Row i: x + w x jo ij j = j N d

23 Define d = largest integer that is d (the whole part of d, if d is positive), function floor(d) + x jo w ijx j = j N All variables 0 w ij d j N x j j N w ij x j x jo + w ij j N x j d Left hand side is integer x jo + w ij x j d j N

24 From the first and last formula d d (w ij w ij j N Denote the fractional parts by ) x j r = d d, f ij = w ij w ij Cut constraint or a cutting plane in the solution space: j N f ij x j r

25 Equation form, using a slack variable s i : j N f ij x j + s i = r This equation is of basic form, with value of the basic variable s i = r. Resulting simplex tableau is optimal but infeasible we apply the dual simplex method until all variables are nonnegative. The cut constraints do not cut out any feasible integer points and they pass through at least one integer point.

26 CUTTING PLANE ALGORITHM: 0. Solve the LP-relaxation. Stop, if all variables in the solution have integer values: then it is the optimum. Stop, if the problem is infeasible or unbounded. 1. Select a row with a fractional RHS: this is called the source row. Generate the cut constraint associated with this row: fijx j + si = r j N 2. Augment the simplex tableau with a column for s i and the new constraint row. 3. Solve the LP-problem with the dual simplex method. Stop, if all variables in the solution have integer values: then it is the optimum. Stop, if the problem is infeasible or unbounded. Else, go to 1

27 The source row can be chosen arbitrarily. Also the objective row can be used because the value of f must be integer. If a cut constraint becomes inactive again with s i > 0, then variable s i and its row can be eliminated from the tableau. This means a new cut makes the old one unnecessary. The elimination restricts the growth of the simplex tableau. The number of iterations is difficult to estimate but being an exact method like the B&B, the computation time is not polynomially bounded.

28 Example 3.2 (cf. B&B solution in example 3.1) min f = 4x 1 + 5x 2 x 1 + 4x 2 5 3x 1 + 2x 2 7 x 1, x 2 0, both integer. Basic form with slack variables x 3, x 4. f 4x 1 5x 2 = 0 x 1 4x 2 + x 3 = 5 3x 1 2x 2 + x 4 = 7

29 Dual simplex method: f x 3 x 4 f x 3 x 1 f x 2 x 1 x 1 x 2 x 3 x /3 0-4/3 0-10/3 1-1/3 1 2/3 0-1/ /10-11/ /10 1/ /10-4/ /3-8/3 7/3 112/10 8/10 18/10 Optimal solution of the LP-relaxation. Last row as the source row: x 1 + 2/10 x 3 4/10 x 4 = 18/10

30 x 1 + 2/10 x 3 4/10 x 4 = 18/10 x 1 + (0 + 2/10) x 3 + ( 1 + 6/10) x 4 = 1 + 8/10 Cut constraint 2/10 x 3 + 6/10 x 4 8/10 Basic form 2/10 x 3 6/10 x 4 + s 1 = 8/10 Continue with the dual simplex method.

31 f x 2 x 1 s 1 f x 2 x 1 x 4 x 1 x 2 x 3 x 4 s /10-11/ /10 1/ /10-4/ /10-6/ /6 0-11/ /6 0 1/ /6 0-4/ /6 1-10/6 112/10 8/10 18/10-8/10 76/6 4/6 14/6 8/6 Second row as a source row: x 2 2/6 x 3 + 1/6 s 1 = 4/6 x 2 +( 1+4/6) x 3 +(0+1/6) s 1 = 0+4/6 Cut constraint: 4/6 x 3 + 1/6 s 1 4/6. Equation to the simplex tableau: 4/6 x 3 1/6 s 1 + s 2 = 4/6

32 f x 2 x 1 x 4 s 2 f x 2 x 1 x 4 x 3 x 1 x 2 x 3 x 4 s 1 s /6 0-11/ /6 0 1/ /6 0-4/ /6 1-10/ /6 0-1/ /4-1/ /4-1/ /4 1/ /4 1/ /4-3/2 76/6 4/6 14/6 8/6-4/ Integer solution found: x 1 = 2, x 2 = 1 ja f min = 13.

33 COMBINATION: BRANCH AND CUT In the Branch and cut method these approaches are combined. Cut constraints are added to the LP-relaxation before applying the Branch & Bound. By producing tighter bounds and reducing the feasible set, the fathoming becomes more efficient, which means a smaller number of subproblems have to be generated.

### 15.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

### Discrete Optimization. Lecture Notes 2

Discrete Optimization. Lecture Notes 2 Disjunctive Constraints Defining variables and formulating linear constraints can be straightforward or more sophisticated, depending on the problem structure. The

### SUBSTITUTING GOMORY CUTTING PLANE METHOD TOWARDS BALAS ALGORITHM FOR SOLVING BINARY LINEAR PROGRAMMING

Bulletin of Mathematics Vol. 06, No. 0 (20), pp.. SUBSTITUTING GOMORY CUTTING PLANE METHOD TOWARDS BALAS ALGORITHM FOR SOLVING BINARY LINEAR PROGRAMMING Eddy Roflin, Sisca Octarina, Putra B. J Bangun,

Iterative Improvement Algorithm design technique for solving optimization problems Start with a feasible solution Repeat the following step until no improvement can be found: change the current feasible

### SUBSTITUTING GOMORY CUTTING PLANE METHOD TOWARDS BALAS ALGORITHM FOR SOLVING BINARY LINEAR PROGRAMMING

ASIAN JOURNAL OF MATHEMATICS AND APPLICATIONS Volume 2014, Article ID ama0156, 11 pages ISSN 2307-7743 http://scienceasia.asia SUBSTITUTING GOMORY CUTTING PLANE METHOD TOWARDS BALAS ALGORITHM FOR SOLVING

### Column 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

### BCN Decision and Risk Analysis. Syed M. Ahmed, Ph.D.

Linear Programming Module Outline Introduction The Linear Programming Model Examples of Linear Programming Problems Developing Linear Programming Models Graphical Solution to LP Problems The Simplex Method

### L2: Algorithms: Knapsack Problem & BnB

L2: Algorithms: Knapsack Problem & BnB This tutorial covers the basic topics on creating a forms application, common form controls and the user interface for the optimization models, algorithms and heuristics,

### lpsymphony - Integer Linear Programming in R

lpsymphony - Integer Linear Programming in R Vladislav Kim October 30, 2017 Contents 1 Introduction 2 2 lpsymphony: Quick Start 2 3 Integer Linear Programming 5 31 Equivalent and Dual Formulations 5 32

### CSE 40/60236 Sam Bailey

CSE 40/60236 Sam Bailey Solution: any point in the variable space (both feasible and infeasible) Cornerpoint solution: anywhere two or more constraints intersect; could be feasible or infeasible Feasible

### M2 ORO: Advanced Integer Programming. Part IV. Solving MILP (1) easy IP. Outline. Sophie Demassey. October 10, 2011

M2 ORO: Advanced Integer Programming Sophie Demassey Part IV Solving MILP (1) Mines Nantes - TASC - INRIA/LINA CNRS UMR 6241 sophie.demassey@mines-nantes.fr October 10, 2011 Université de Nantes / M2 ORO

### Generalized Network Flow Programming

Appendix C Page Generalized Network Flow Programming This chapter adapts the bounded variable primal simplex method to the generalized minimum cost flow problem. Generalized networks are far more useful

### Section 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

### GENERAL ASSIGNMENT PROBLEM via Branch and Price JOHN AND LEI

GENERAL ASSIGNMENT PROBLEM via Branch and Price JOHN AND LEI Outline Review the column generation in Generalized Assignment Problem (GAP) GAP Examples in Branch and Price 2 Assignment Problem The assignment

### / Approximation Algorithms Lecturer: Michael Dinitz Topic: Linear Programming Date: 2/24/15 Scribe: Runze Tang

600.469 / 600.669 Approximation Algorithms Lecturer: Michael Dinitz Topic: Linear Programming Date: 2/24/15 Scribe: Runze Tang 9.1 Linear Programming Suppose we are trying to approximate a minimization

### MATLAB Solution of Linear Programming Problems

MATLAB Solution of Linear Programming Problems The simplex method is included in MATLAB using linprog function. All is needed is to have the problem expressed in the terms of MATLAB definitions. Appendix

### 11. APPROXIMATION ALGORITHMS

11. APPROXIMATION ALGORITHMS load balancing center selection pricing method: vertex cover LP rounding: vertex cover generalized load balancing knapsack problem Lecture slides by Kevin Wayne Copyright 2005

### AM 121: Intro to Optimization Models and Methods Fall 2017

AM 121: Intro to Optimization Models and Methods Fall 2017 Lecture 10: Dual Simplex Yiling Chen SEAS Lesson Plan Interpret primal simplex in terms of pivots on the corresponding dual tableau Dictionaries

### 16.410/413 Principles of Autonomy and Decision Making

16.410/413 Principles of Autonomy and Decision Making Lecture 17: The Simplex Method Emilio Frazzoli Aeronautics and Astronautics Massachusetts Institute of Technology November 10, 2010 Frazzoli (MIT)

### Constraint 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

### Pure 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

### COVERING POINTS WITH AXIS PARALLEL LINES. KAWSAR JAHAN Bachelor of Science, Bangladesh University of Professionals, 2009

COVERING POINTS WITH AXIS PARALLEL LINES KAWSAR JAHAN Bachelor of Science, Bangladesh University of Professionals, 2009 A Thesis Submitted to the School of Graduate Studies of the University of Lethbridge

### The Simplex Algorithm

The Simplex Algorithm Uri Feige November 2011 1 The simplex algorithm The simplex algorithm was designed by Danzig in 1947. This write-up presents the main ideas involved. It is a slight update (mostly

### Last topic: Summary; Heuristics and Approximation Algorithms Topics we studied so far:

Last topic: Summary; Heuristics and Approximation Algorithms Topics we studied so far: I Strength of formulations; improving formulations by adding valid inequalities I Relaxations and dual problems; obtaining

### VARIANTS OF THE SIMPLEX METHOD

C H A P T E R 6 VARIANTS OF THE SIMPLEX METHOD By a variant of the Simplex Method (in this chapter) we mean an algorithm consisting of a sequence of pivot steps in the primal system using alternative rules

### MINIZSAT. A semi SAT-based pseudo-boolean solver. Master thesis by Rogier Poldner

MINIZSAT A semi SAT-based pseudo-boolean solver Master thesis by Rogier Poldner MINIZSAT A semi SAT-based pseudo-boolean solver Master thesis by Rogier Poldner committee: Dr. H. van Maaren Dr. M.J.H.

### Discrete Optimization 2010 Lecture 5 Min-Cost Flows & Total Unimodularity

Discrete Optimization 2010 Lecture 5 Min-Cost Flows & Total Unimodularity Marc Uetz University of Twente m.uetz@utwente.nl Lecture 5: sheet 1 / 26 Marc Uetz Discrete Optimization Outline 1 Min-Cost Flows

### Constructive and destructive algorithms

Constructive and destructive algorithms Heuristic algorithms Giovanni Righini University of Milan Department of Computer Science (Crema) Constructive algorithms In combinatorial optimization problems every

### COT 6936: Topics in Algorithms! Giri Narasimhan. ECS 254A / EC 2443; Phone: x3748

COT 6936: Topics in Algorithms! Giri Narasimhan ECS 254A / EC 2443; Phone: x3748 giri@cs.fiu.edu http://www.cs.fiu.edu/~giri/teach/cot6936_s12.html https://moodle.cis.fiu.edu/v2.1/course/view.php?id=174

### Algorithms for the Precedence Constrained Generalized Travelling Salesperson Problem

MASTER S THESIS Algorithms for the Precedence Constrained Generalized Travelling Salesperson Problem RAAD SALMAN Department of Mathematical Sciences Division of Mathematics CHALMERS UNIVERSITY OF TECHNOLOGY

### Introduction to Linear Programming

Introduction to Linear Programming Eric Feron (updated Sommer Gentry) (updated by Paul Robertson) 16.410/16.413 Historical aspects Examples of Linear programs Historical contributor: G. Dantzig, late 1940

### How to Solve a Standard Maximization Problem Using the Simplex Method and the Rowops Program

How to Solve a Standard Maximization Problem Using the Simplex Method and the Rowops Program Problem: Maximize z = x + 0x subject to x + x 6 x + x 00 with x 0 y 0 I. Setting Up the Problem. Rewrite each

### Computational Methods. Constrained Optimization

Computational Methods Constrained Optimization Manfred Huber 2010 1 Constrained Optimization Unconstrained Optimization finds a minimum of a function under the assumption that the parameters can take on

### 4.1 Graphical solution of a linear program and standard form

4.1 Graphical solution of a linear program and standard form Consider the problem min c T x Ax b x where x = ( x1 x ) ( 16, c = 5 ), b = 4 5 9, A = 1 7 1 5 1. Solve the problem graphically and determine

### 11.1 Facility Location

CS787: Advanced Algorithms Scribe: Amanda Burton, Leah Kluegel Lecturer: Shuchi Chawla Topic: Facility Location ctd., Linear Programming Date: October 8, 2007 Today we conclude the discussion of local

### Primal 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

### Construction of Minimum-Weight Spanners Mikkel Sigurd Martin Zachariasen

Construction of Minimum-Weight Spanners Mikkel Sigurd Martin Zachariasen University of Copenhagen Outline Motivation and Background Minimum-Weight Spanner Problem Greedy Spanner Algorithm Exact Algorithm:

### Approximation Algorithms: The Primal-Dual Method. My T. Thai

Approximation Algorithms: The Primal-Dual Method My T. Thai 1 Overview of the Primal-Dual Method Consider the following primal program, called P: min st n c j x j j=1 n a ij x j b i j=1 x j 0 Then the

### Heuristics 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).

### Pre-requisite Material for Course Heuristics and Approximation Algorithms

Pre-requisite Material for Course Heuristics and Approximation Algorithms This document contains an overview of the basic concepts that are needed in preparation to participate in the course. In addition,

### 5 The Theory of the Simplex Method

5 The Theory of the Simplex Method Chapter 4 introduced the basic mechanics of the simplex method. Now we shall delve a little more deeply into this algorithm by examining some of its underlying theory.

### A Row-and-Column Generation Method to a Batch Machine Scheduling Problem

The Ninth International Symposium on Operations Research and Its Applications (ISORA 10) Chengdu-Jiuzhaigou, China, August 19 23, 2010 Copyright 2010 ORSC & APORC, pp. 301 308 A Row-and-Column Generation

### 5. DUAL LP, SOLUTION INTERPRETATION, AND POST-OPTIMALITY

5. DUAL LP, SOLUTION INTERPRETATION, AND POST-OPTIMALITY 5.1 DUALITY Associated with every linear programming problem (the primal) is another linear programming problem called its dual. If the primal involves

### The SYMPHONY Callable Library for Mixed-Integer Linear Programming

The SYMPHONY Callable Library for Mixed-Integer Linear Programming Ted Ralphs and Menal Guzelsoy Industrial and Systems Engineering Lehigh University INFORMS Computing Society Conference, Annapolis, MD,

### Algorithm Design Techniques (III)

Algorithm Design Techniques (III) Minimax. Alpha-Beta Pruning. Search Tree Strategies (backtracking revisited, branch and bound). Local Search. DSA - lecture 10 - T.U.Cluj-Napoca - M. Joldos 1 Tic-Tac-Toe

### Investigating Mixed-Integer Hulls using a MIP-Solver

Investigating Mixed-Integer Hulls using a MIP-Solver Matthias Walter Otto-von-Guericke Universität Magdeburg Joint work with Volker Kaibel (OvGU) Aussois Combinatorial Optimization Workshop 2015 Outline

### The goal of this paper is to develop models and methods that use complementary

for a Class of Optimization Problems Vipul Jain Ignacio E. Grossmann Department of Chemical Engineering, Carnegie Mellon University, Pittsburgh, Pennsylvania, 15213, USA Vipul_Jain@i2.com grossmann@cmu.edu

### Let s start by examining an Excel worksheet for the linear programming. Maximize P 70x 120y. subject to

Excel is a useful tool for solving linear programming problems. In this question we ll solve and analyze our manufacturing problem with Excel. Although this problem can easily be solved graphically or

### Linear Programming and Integer Linear Programming

Linear Programming and Integer Linear Programming Kurt Mehlhorn May 26, 2013 revised, May 20, 2014 1 Introduction 2 2 History 3 3 Expressiveness 3 4 Duality 4 5 Algorithms 8 5.1 Fourier-Motzkin Elimination............................

### Math Introduction to Operations Research

Math 300 Introduction to Operations Research Examination (50 points total) Solutions. (6 pt total) Consider the following linear programming problem: Maximize subject to and x, x, x 3 0. 3x + x + 5x 3

### The successful solution of large-scale mixed integer

BRANCH-AND-PRICE: COLUMN GENERATION FOR SOLVING HUGE INTEGER PROGRAMS CYNTHIA BARNHART*, ELLIS L. JOHNSON, GEORGE L. NEMHAUSER, MARTIN W. P. SAVELSBERGH, and PAMELA H. VANCE** Georgia Institute of Technology,

### Modified Order Crossover (OX) Operator

Modified Order Crossover (OX) Operator Ms. Monica Sehrawat 1 N.C. College of Engineering, Israna Panipat, Haryana, INDIA. Mr. Sukhvir Singh 2 N.C. College of Engineering, Israna Panipat, Haryana, INDIA.

### Branch-and-cut implementation of Benders decomposition Matteo Fischetti, University of Padova

Branch-and-cut implementation of Benders decomposition Matteo Fischetti, University of Padova 8th Cargese-Porquerolles Workshop on Combinatorial Optimization, August 2017 1 Mixed-Integer Programming We

### Chapter 3: Towards the Simplex Method for Efficient Solution of Linear Programs

Chapter 3: Towards the Simplex Method for Efficient Solution of Linear Programs The simplex method, invented by George Dantzig in 1947, is the basic workhorse for solving linear programs, even today. While

### Linear Programming. Slides by Carl Kingsford. Apr. 14, 2014

Linear Programming Slides by Carl Kingsford Apr. 14, 2014 Linear Programming Suppose you are given: A matrix A with m rows and n columns. A vector b of length m. A vector c of length n. Find a length-n

### Experience with CGL in the PICO Mixed- Integer Programming Solver

Experience with CGL in the PICO Mixed- Integer Programming Solver Cynthia A. Phillips, Sandia National Laboratories Joint work with Jonathan Eckstein, Rutgers William Hart, Sandia Sandia is a multiprogram

### A NEW SEQUENTIAL CUTTING PLANE ALGORITHM FOR SOLVING MIXED INTEGER NONLINEAR PROGRAMMING PROBLEMS

EVOLUTIONARY METHODS FOR DESIGN, OPTIMIZATION AND CONTROL P. Neittaanmäki, J. Périaux and T. Tuovinen (Eds.) c CIMNE, Barcelona, Spain 2007 A NEW SEQUENTIAL CUTTING PLANE ALGORITHM FOR SOLVING MIXED INTEGER

### 16.410/413 Principles of Autonomy and Decision Making

16.410/413 Principles of Autonomy and Decision Making Lecture 16: Mathematical Programming I Emilio Frazzoli Aeronautics and Astronautics Massachusetts Institute of Technology November 8, 2010 E. Frazzoli

### Kurt Mehlhorn, MPI für Informatik. Curve and Surface Reconstruction p.1/25

Curve and Surface Reconstruction Kurt Mehlhorn MPI für Informatik Curve and Surface Reconstruction p.1/25 Curve Reconstruction: An Example probably, you see more than a set of points Curve and Surface

### A hard integer program made easy by lexicography

Noname manuscript No. (will be inserted by the editor) A hard integer program made easy by lexicography Egon Balas Matteo Fischetti Arrigo Zanette February 16, 2011 Abstract A small but notoriously hard

### Restrict-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:

### Minimal Infeasible Subsystems and Benders cuts

Mathematical Programming manuscript No. (will be inserted by the editor) Matteo Fischetti Domenico Salvagnin Arrigo Zanette Minimal Infeasible Subsystems and Benders cuts Received: date / Revised Sept.

### Problem set 2. Problem 1. Problem 2. Problem 3. CS261, Winter Instructor: Ashish Goel.

CS261, Winter 2017. Instructor: Ashish Goel. Problem set 2 Electronic submission to Gradescope due 11:59pm Thursday 2/16. Form a group of 2-3 students that is, submit one homework with all of your names.

### CMSC 451: Linear Programming

CMSC 451: Linear Programming Slides By: Carl Kingsford Department of Computer Science University of Maryland, College Park Linear Programming Suppose you are given: A matrix A with m rows and n columns.

### Computational complexity

Computational complexity Heuristic Algorithms Giovanni Righini University of Milan Department of Computer Science (Crema) Definitions: problems and instances A problem is a general question expressed in

### Linear Programming with Bounds

Chapter 481 Linear Programming with Bounds Introduction Linear programming maximizes (or minimizes) a linear objective function subject to one or more constraints. The technique finds broad use in operations

### Vertex Cover Approximations

CS124 Lecture 20 Heuristics can be useful in practice, but sometimes we would like to have guarantees. Approximation algorithms give guarantees. It is worth keeping in mind that sometimes approximation

### (Duality), Warm Starting, and Sensitivity Analysis for MILP

(Duality), Warm Starting, and Sensitivity Analysis for MILP Ted Ralphs and Menal Guzelsoy Industrial and Systems Engineering Lehigh University INFORMS Annual Conference, Denver, CO, Tuesday, October 26,

### CASE STUDY. fourteen. Animating The Simplex Method. case study OVERVIEW. Application Overview and Model Development.

CASE STUDY fourteen Animating The Simplex Method case study OVERVIEW CS14.1 CS14.2 CS14.3 CS14.4 CS14.5 CS14.6 CS14.7 Application Overview and Model Development Worksheets User Interface Procedures Re-solve

### A 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:

### Ruled Based Approach for Scheduling Flow-shop and Job-shop Problems

Ruled Based Approach for Scheduling Flow-shop and Job-shop Problems Mohammad Komaki, Shaya Sheikh, Behnam Malakooti Case Western Reserve University Systems Engineering Email: komakighorban@gmail.com Abstract

### Topic: Local Search: Max-Cut, Facility Location Date: 2/13/2007

CS880: Approximations Algorithms Scribe: Chi Man Liu Lecturer: Shuchi Chawla Topic: Local Search: Max-Cut, Facility Location Date: 2/3/2007 In previous lectures we saw how dynamic programming could be

### COMP 355 Advanced Algorithms Approximation Algorithms: VC and TSP Chapter 11 (KT) Section (CLRS)

COMP 355 Advanced Algorithms Approximation Algorithms: VC and TSP Chapter 11 (KT) Section 35.1-35.2(CLRS) 1 Coping with NP-Completeness Brute-force search: This is usually only a viable option for small

### Chapter 4: The Mechanics of the Simplex Method

Chapter 4: The Mechanics of the Simplex Method The simplex method is a remarkably simple and elegant algorithmic engine for solving linear programs. In this chapter we will examine the internal mechanics

### CS261: Problem Set #2

CS261: Problem Set #2 Due by 11:59 PM on Tuesday, February 9, 2016 Instructions: (1) Form a group of 1-3 students. You should turn in only one write-up for your entire group. (2) Submission instructions:

### CS 598CSC: Approximation Algorithms Lecture date: March 2, 2011 Instructor: Chandra Chekuri

CS 598CSC: Approximation Algorithms Lecture date: March, 011 Instructor: Chandra Chekuri Scribe: CC Local search is a powerful and widely used heuristic method (with various extensions). In this lecture

### Other Algorithms for Linear Programming Chapter 7

Other Algorithms for Linear Programming Chapter 7 Introduction The Simplex method is only a part of the arsenal of algorithms regularly used by LP practitioners. Variants of the simplex method the dual

### Cutting 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

### On Clarkson s Las Vegas Algorithms for Linear and Integer Programming When the Dimension is Small

On Clarkson s Las Vegas Algorithms for Linear and Integer Programming When the Dimension is Small Robert Bassett March 10, 2014 2 Question/Why Do We Care Motivating Question: Given a linear or integer

### An Introduction to LP Relaxations for MAP Inference

An Introduction to LP Relaxations for MAP Inference Adrian Weller MLSALT4 Lecture Feb 27, 2017 With thanks to David Sontag (NYU) for use of some of his slides and illustrations For more information, see

### Problem Set 5 Solutions

Design and Analysis of Algorithms?? Massachusetts Institute of Technology 6.046J/18.410J Profs. Erik Demaine, Srini Devadas, and Nancy Lynch Problem Set 5 Solutions Problem Set 5 Solutions This problem

### Minimum-Energy Broadcast and Multicast in Wireless Networks: An Integer Programming Approach and Improved Heuristic Algorithms

Minimum-Energy Broadcast and Multicast in Wireless Networks: An Integer Programming Approach and Improved Heuristic Algorithms Di Yuan a, a Department of Science and Technology, Linköping University, SE-601

### Analysis and optimization methods of graph based meta-models for data flow simulation

Rochester Institute of Technology RIT Scholar Works Theses Thesis/Dissertation Collections 8-1-2010 Analysis and optimization methods of graph based meta-models for data flow simulation Jeffrey Harrison

### Decomposition in Integer Linear Programming

Decomposition in Integer Linear Programming M.V. Galati Advanced Analytics - Operations R & D, SAS Institute, Chesterbrook, PA 9 Ted K. Ralphs Department of Industrial and System Engineering, Lehigh University,

### The complement of PATH is in NL

340 The complement of PATH is in NL Let c be the number of nodes in graph G that are reachable from s We assume that c is provided as an input to M Given G, s, t, and c the machine M operates as follows:

### Combinatorial Optimization - Lecture 14 - TSP EPFL

Combinatorial Optimization - Lecture 14 - TSP EPFL 2012 Plan Simple heuristics Alternative approaches Best heuristics: local search Lower bounds from LP Moats Simple Heuristics Nearest Neighbor (NN) Greedy

### Introduction. Chapter 15. Optimization Modeling: Applications. Integer Programming. Manufacturing Example. Three Types of ILP Models

Chapter 5 Optimization Modeling: Applications Integer Programming Introduction When one or more variables in an LP problem must assume an integer value we have an Integer Linear Programming (ILP) problem.

### Part 1. The Review of Linear Programming The Revised Simplex Method

In the name of God Part 1. The Review of Linear Programming 1.4. Spring 2010 Instructor: Dr. Masoud Yaghini Introduction Outline in Tableau Format Comparison Between the Simplex and the Revised Simplex

### A modification of the simplex method reducing roundoff errors

A modification of the simplex method reducing roundoff errors Ralf Ulrich Kern Georg-Simon-Ohm-Hochschule Nürnberg Fakultät Informatik Postfach 21 03 20 90121 Nürnberg Ralf-Ulrich.Kern@ohm-hochschule.de

### An Improved Algorithm for Solving Biobjective Integer Programs

An Improved Algorithm for Solving Biobjective Integer Programs Ted K. Ralphs Matthew J. Saltzman Margaret M. Wiecek Revised January 15, 2005 Abstract A parametric algorithm for identifying the Pareto set

### Graphs that have the feasible bases of a given linear

Algorithmic Operations Research Vol.1 (2006) 46 51 Simplex Adjacency Graphs in Linear Optimization Gerard Sierksma and Gert A. Tijssen University of Groningen, Faculty of Economics, P.O. Box 800, 9700

### Cutting Stock with Binary Patterns: Arc-flow Formulation with Graph Compression

Cutting Stock with Binary Patterns: Arc-flow Formulation with Graph Compression Filipe Brandão INESC TEC and Faculdade de Ciências, Universidade do Porto, Portugal fdabrandao@dcc.fc.up.pt arxiv:1502.02899v1

### 15-451/651: Design & Analysis of Algorithms November 4, 2015 Lecture #18 last changed: November 22, 2015

15-451/651: Design & Analysis of Algorithms November 4, 2015 Lecture #18 last changed: November 22, 2015 While we have good algorithms for many optimization problems, the previous lecture showed that many

### The Branch & Move algorithm: Improving Global Constraints Support by Local Search

Branch and Move 1 The Branch & Move algorithm: Improving Global Constraints Support by Local Search Thierry Benoist Bouygues e-lab, 1 av. Eugène Freyssinet, 78061 St Quentin en Yvelines Cedex, France tbenoist@bouygues.com

### Steiner Trees and Forests

Massachusetts Institute of Technology Lecturer: Adriana Lopez 18.434: Seminar in Theoretical Computer Science March 7, 2006 Steiner Trees and Forests 1 Steiner Tree Problem Given an undirected graph G

### Pearls of Algorithms

Part 3: Randomized Algorithms and Probabilistic Analysis Prof. Dr. Institut für Informatik Winter 2013/14 Efficient Algorithms When is an algorithm considered efficient? Efficient Algorithms When is an

### MLR Institute of Technology

Course Name : Engineering Optimization Course Code : 56021 Class : III Year Branch : Aeronautical Engineering Year : 2014-15 Course Faculty : Mr Vamsi Krishna Chowduru, Assistant Professor Course Objective

### Computational Mathematics: Models, Methods and Analysis. Zhilin Li

Computational Mathematics: Models, Methods and Analysis Zhilin Li Chapter 1 Introduction Why is this course important (motivations)? What is the role of this class in the problem solving process using