Advanced LP models column generation.

Slides:



Advertisements
Similar presentations
Outline LP formulation of minimal cost flow problem
Advertisements

Summary of complementary slackness: 1. If x i ≠ 0, i= 1, 2, …, n the ith dual equation is tight. 2. If equation i of the primal is not tight, y i =0. 1.
1 LP Duality Lecture 13: Feb Min-Max Theorems In bipartite graph, Maximum matching = Minimum Vertex Cover In every graph, Maximum Flow = Minimum.
Solving IPs – Cutting Plane Algorithm General Idea: Begin by solving the LP relaxation of the IP problem. If the LP relaxation results in an integer solution,
ECE Longest Path dual 1 ECE 665 Spring 2005 ECE 665 Spring 2005 Computer Algorithms with Applications to VLSI CAD Linear Programming Duality – Longest.
Linear programming: lp_solve, max flow, dual CSC 282 Fall 2013.
Knapsack Problem Section 7.6. Problem Suppose we have n items U={u 1,..u n }, that we would like to insert into a knapsack of size C. Each item u i has.
Transportation Problem
ENGM 732 Formalization of Network Flows Network Flow Models.
Lecture 5 Set Packing Problems Set Partitioning Problems
18 = = = = = = = =
© 5/7/2002 V.S. Subrahmanian1 Knapsack Problem Notes V.S. Subrahmanian University of Maryland.
MIT and James Orlin © Dynamic Programming 2 –Review –More examples.
Duality Dual problem Duality Theorem Complementary Slackness
ECE LP Duality 1 ECE 665 Spring 2005 ECE 665 Spring 2005 Computer Algorithms with Applications to VLSI CAD Linear Programming Duality.
Linear Programming – Max Flow – Min Cut Orgad Keller.
Computational Methods for Management and Economics Carla Gomes Module 4 Displaying and Solving LP Models on a Spreadsheet.
1 Lecture 4 Maximal Flow Problems Set Covering Problems.
1.3 Modeling with exponentially many constr.  Some strong formulations (or even formulation itself) may involve exponentially many constraints (cutting.
Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine.
Section 2.9 Maximum Flow Problems Minimum Cost Network Flows Shortest Path Problems.
Types of IP Models All-integer linear programs Mixed integer linear programs (MILP) Binary integer linear programs, mixed or all integer: some or all of.
Integer Programming Key characteristic of an Integer Program (IP) or Mixed Integer Linear Program (MILP): One or more of the decision variable must be.
Duality Theory  Every LP problem (called the ‘Primal’) has associated with another problem called the ‘Dual’.  The ‘Dual’ problem is an LP defined directly.
Review for E&CE Find the minimal cost spanning tree for the graph below (where Values on edges represent the costs). 3 Ans. 18.
EMIS 8373: Integer Programming “Easy” Integer Programming Problems: Network Flow Problems updated 11 February 2007.
C&O 355 Mathematical Programming Fall 2010 Lecture 18 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A A.
Chapter 1. Formulations 1. Integer Programming  Mixed Integer Optimization Problem (or (Linear) Mixed Integer Program, MIP) min c’x + d’y Ax +
11.5 Implicit Partitioning/Packing Problems  Given M = {1, …, m}, K implicitly described sets of feasible subsets of M. Find a maximum value packing or.
Columbia Express Algorithms and heuristics used by shipping company Yoon Keun Ane Jeongwho Lee Co- Express.
EMIS 8374 Network Flow Models updated 29 January 2008.
Steiner tree LP x e = 1 if edge e is included in the Steiner tree. Min.  e c e x e (primal) s.t.  e   (S) x e ≥ 1  S  V: S  T≠ , T\S≠  x e 
Integer Programming (정수계획법)
Lecture.6. Table of Contents Lp –rounding Dual Fitting LP-Duality.
Thursday, May 2 Dynamic Programming – Review – More examples Handouts: Lecture Notes.
Lecture 6 Knapsack Problem Quadratic Assignment Problem
Algorithm Design Methods 황승원 Fall 2011 CSE, POSTECH.
Dynamic Programming … Continued 0-1 Knapsack Problem.
LINEAR PROGRAMMING 3.4 Learning goals represent constraints by equations or inequalities, and by systems of equations and/or inequalities, and interpret.
Approximation Algorithms Duality My T. UF.
Greedy Algorithms Prof. Kharat P. V. Department of Information Technology.
Tuesday, March 19 The Network Simplex Method for Solving the Minimum Cost Flow Problem Handouts: Lecture Notes Warning: there is a lot to the network.
Using Variable Domain Functions
Chap 10. Sensitivity Analysis
The minimum cost flow problem
Excel Solver.
ENGM 535 Optimization Networks
1.3 Modeling with exponentially many constr.
Chap 9. General LP problems: Duality and Infeasibility
Chapter 6. Large Scale Optimization
Chapter 5. Sensitivity Analysis
Integer Programming (정수계획법)
1.206J/16.77J/ESD.215J Airline Schedule Planning
EMIS 8374 Arc-Path Formulation Updated 2 April 2008
Transportation Problems
Chapter 1. Formulations (BW)
1.3 Modeling with exponentially many constr.
LINGO LAB 3/4.
Integer Programming (정수계획법)
Chapter 5 Transportation, Assignment, and Transshipment Problems
Algorithm Design Methods
Flow Feasibility Problems
11.5 Implicit Partitioning/Packing Problems
Advanced LP models column generation.
11.5 Implicit Partitioning/Packing Problems
Part II General Integer Programming
Chapter 1. Formulations.
Chapter 6. Large Scale Optimization
EMIS The Maximum Flow Problem: Flows and Cuts Updated 6 March 2008
Applied Statistical and Optimization Models
Presentation transcript:

Advanced LP models column generation

min max

min max OK OK ?

Bin packing example bins of size K items of different types items of type i have size s(i) and there are n(i) of them problem put all items into the bins minimizing the number of bins

+ = 3 1 2 2 4 4 2 + = 4 feasible patterns + = 8

x 2 1 3 4 5 6 7 + = 3 8 4 + 1 1 2 4 3 x 2 1 3 4 5 6 7

min S x i ........ 1 2 1 3 ........ x = 2 2 4 3 4 ........ 4 4 4 2 8 x integer

min max OK OK ?

1 2 4 3 ............ < 1 .. ........ 1 2 1 y 2 3 1 ........ 2 2 4 3 ........ 4 4 4 2

y < + 1 2 2 y < + a y < + a s < K + max a y + < 1 3 1 < + 1 2 2 y 3 1 < + a 2 3 1 y < + for all feasible patterns a 2 3 1 s < K + max a 2 3 1 y + < 1

otherwise add pattern maximizing knapsack 2 3 1 y + a 2 3 1 s < K + a 1 a 2 a 3 integer knapsack ! if max 1 optimality ! < otherwise add pattern maximizing knapsack

example bin capacity = 20 3 types: type 1: size = 7; quantity = 50 type 2: size = 5; quantity =100 type 3: size = 3; quantity = 70 25 24 4 53 bins x starting patterns 2 0 2 0 4 0 y= ( 0 1/4 1/2 ) generated patterns 0 0 6 y= ( 1/3 1/4 1/6 ) 0 1 5 y= ( .35 .25 .15 )

however, change quantities to 52 97 71 solution is : x = 26 1 x = 23.3 x = 0 x = 3.8 2 3 4 53.1 how to get an integer solution?

V(j)=optimal value for a knapsack of capacity j max a 2 3 1 y + < 1 a 2 3 1 s < K + a 1 a 2 a 3 integer V(j)=optimal value for a knapsack of capacity j V(j) = max { V(j - s(i)) + y(i) : i= 1, ... , n} V(j) > V(j - s(i)) + y(i) i= 1, ... , n; j=1,...,K V(K) < 1 V(j) >

min max

max S b(i) y(i) V(j) > V(j - s(i)) + y(i) i= 1, ... , n; j=1,...,K V(K) < 1 V(j) > however this is the dual problem we need the patterns which are in the primal so let’s make the dual of the above problem

It turns out that the dual is a flow problem nodes capacity values (0,1,2,...,K) arcs each possible filling from capacity j to capacity j+s(i) dual variables flows on arcs

4 29 24 25 1 2 3 4 5 6 7 8 9 10 11 12 25+4 13 14 15 16 17 18 19 20

4 25 times the pattern 2 0 2 25 1 2 3 4 24 4 5 4 6 25 7 8 24 9 10 11 12 25+4 13 29 4 14 15 24 25+4 16 17 18 24 19 20

4 24 times the pattern 0 4 0 1 25 2 24 3 4 4 5 4 6 7 25 8 24 9 10 11 12 25+4 13 29 4 14 15 24 16 25+4 17 18 24 19 20

4 4 times the pattern 0 1 5 1 25 2 4 3 24 4 5 4 6 7 25 8 24 9 10 11 12 25+4 4 13 29 14 15 24 25+4 16 17 18 24 19 20