Lecture2 - Integer Programming IE418 Lecture 2 Dr. Ted...

Info iconThis preview shows pages 1–7. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Integer Programming IE418 Lecture 2 Dr. Ted Ralphs IE418 Lecture 2 1 Reading for This Lecture Wolsey Chapter 1 N&W Sections I.1.1-I.1.6 IE418 Lecture 2 2 Piecewise Linear Cost Functions We can use binary variables to model arbitrary piecewise linear cost functions . The function is specified by ordered pairs ( a i , f ( a i )) and we wish to evaluate it at a point x . We have a binary variable y i , which indicates whether a i x a i +1 . To evaluate the function , we will take linear combinations k i =1 i f ( a i ) of the given functions values. This only works if the only two nonzero i s are the ones corresponding to the endpoints of the interval in which x lies. IE418 Lecture 2 3 Minimizing Piecewise Linear Cost Functions The following formulation minimizes the function. min k X i =1 i f ( a i ) s.t. k X i =1 = 1 , 1 y 1 , i y i- 1 + y i , i [2 ..k- 1] , k y k- 1 , k- 1 X i =1 y i = 1 , i , y i { , 1 } . The key is that if y j = 1 , then i = 0 , i = j, j + 1 . IE418 Lecture 2 4 Fixed-charge Problems In many instances, there is a fixed cost and a variable cost associated with a particular decision. Example : Fixed-charge Network Flow Problem We are given a directed graph G = ( N, A ) . There is a fixed cost c ij associated with opening arc ( i, j ) (think of this as the cost to build the link). There is also a variable cost d ij associated with each unit of flow along arc ( i, j ) . Consider an instance with a single supply node. * Minimizing the fixed cost by itself is a minimum spanning tree problem ( easy ). * Minimizing the variable cost by itself is a minimum cost network flow problem ( easy ). * We want to minimize the sum of these two costs ( difficult ). IE418 Lecture 2 5 Modeling the Fixed-charge Network Flow Problem To model the FCNFP, we associate two variables with each arc....
View Full Document

This note was uploaded on 08/06/2008 for the course IE 418 taught by Professor Ralphs during the Spring '08 term at Lehigh University .

Page1 / 18

Lecture2 - Integer Programming IE418 Lecture 2 Dr. Ted...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online