ENGRI 1101 Engineering Applications of OR
Fall ’09 Homework 10
Integer Programming II
•
Due date:
4:00pm on Friday, November 20, 2009
in the ENGRI 1101 box at the west end of the
corridor on the second ﬂoor of Rhodes Hall, where it connects to Upson.
•
Reading assignment: Handout 9 in the course packet and Chapter 9 of Winston (“Integer Program
ming”), also included in the course packet.
•
Make sure to put your name, netid and section on the cover page and staple the problems in order.
1. (50) Consider the small Sudoku puzzle posted in the Problem Set folder on Blackboard. Give an integer
program whose solution you could use to ﬁnd the answer to this puzzle. (Hint: you should only use
variables that are constrained to be either 0 or 1, just like in the assignment problem.)
2. (50) You wish to apply branchandbound to a maximization integer program with 01 variables (that
is, the variables are restricted to be either 0 or 1).
(a) (5) When you solve a linear programming relaxation and branch on some variable
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
This is the end of the preview.
Sign up
to
access the rest of the document.
 Fall '09
 TROTTER
 Operations Research, Linear Programming, Optimization, Rhodes Hall, maximization integer program, LP Optimum

Click to edit the document details