This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Industrial Engineering Fall Integer Programming Homework Last updated: August , Due: Friday September , in class Note: only a proper subset of these problems will be graded. Prob em . (Bertsimas and Weismantel, Exercise . ) Suppose you are planning to move to your new house. You have n items of size a j , j = , . . . , n , that need to be moved. You have rented a truck that has size Q and you have bought m boxes. Box i has size b i , i = , . . . , m . Formulate an integer program in order to decide whether the move is possible. Note that you can put multiple items in the same box and size is the only criterion determining if an item can be put in a box. Prob em . (Bertsimas and Weismantel, Exercise . ) Consider the separable nonlinear optimization problem minimize n j = f , j ( x j ) subject to n j = f i , j ( x j ) b i , i = , . . . , m , x j u j , j = , . . . , n , where the functions f i , j ( x j ) , i = , , . . . , m , j = , . . . , n are continuous, piecewise linear with at most pieces. Propose an integer program for the separable nonlinear optimization problem. Prob em . (Bertsimas and Weismantel, Exercise . ) a. We are given points ( x i , a i ) , i = , . . . , m , where x i R n and a i , , which indicates the category that point x i belongs to. We would like to decide whether it is possible to separate the pointsbelongs to....
View Full Document
This note was uploaded on 02/14/2012 for the course IE 530 taught by Professor Ravindran during the Spring '97 term at Purdue.
- Spring '97
- Industrial Engineering