Department of Industrial Engineering & Operations Research

IEOR 160: Operations Research I (Fall 2014)

Homework 4
Due: Friday, Oct 3th
Question 1. A basketball coach needs to choose ve players to form the starting lineup of his
team. The team consists of seven players in total, who have been rated on a scale of 1 (poor) to
3 (excellent) according to their ball handling, shooting, rebounding, and defensive abilities. There
are three positions: Guard (G), Center (C), and Forward (F). The positions that each player is
capable of playing and the players abilities are summarized in the following table:
Player Position Ball-Handling Shooting Rebounding Defense
1 G 3 3 1 3
2 C 2 1 3 2
3 G, F 2 3 2 2
4 F, C 1 3 3 1
5 G, F 3 3 3 3
6 F, C 3 1 2 3
7 G, F 3 2 2 1
The ve-player starting lineup must satisfy the following restrictions:
1. At least 4 players must be able to play guard, at least two players must be able to play
forward, and at least 1 player must be able to play center.
2. The average ball handling, shooting, and rebouding level of the starting lineup must be at
least 2.
3. If player 3 is included, player 6 cannot be included.
4. If player 1 is included, then players 4 and 5 must both be included.
5. Either player 2 or player 3 must be included.
Given these constraints, formulate an integer program that maximizes the defensive ability of the
starting lineup (i.e. maximizes total defensive points).
1
Question 2. Consider the following linear program:
minimize x
1
+ 2x
2
x
3
+ 80x
4
subject to x
1
x
2
+ 2x
3
2
x
1
2x
3
+ 2x
4
= 0
x
2
+ x
4
0
2x
3
+ 3x
4
0
x
1
+ x
2
x
3
+ x
4
1
x
1
+ x
4
1
3x
1
x
2
x
3
x
4
= 0
x
1
, x
2
, x
3
, x
4
0
It turns out that there are no feasible solutions to this problem. However, if we remove some of the
constraints, we can obtain a modied formulation that does have a feasible solution. Formulate an
integer program that identies the minimum number of constraints that must be removed so that
the resulting problem is feasible.
Question 3. Consider a 4 4 chessboard. Formulate an integer program that maximizes the
number of queens that can be placed on the board such that no queen can capture any other queen.
Question 4. Solve the following integer program using the branch and bound algorithm. Solve
the linear programming relaxation at each node using the graphical method.
maximize 5x
1
+ 2x
2
subject to 3x
1
+ x
2
12
x
1
+ x
2
5
x
1
, x
2
0
x
1
, x
2
integer
2