Ilp Basketball
Ilp Basketball
Coach Night is trying to choose the starting line-up for the basketball team. The team
consists of seven players who have been rated (on a scale of 1=poor to 3=excellent)
according to their ball-handling, shooting, rebounding, and defensive abilities. The
positions that each player is allowed to play (G=guard, C=center, F=forward) and the
player's abilities are:
(ii)The average ball-handling, shooting, and rebounding level of the starting lineup
must each be at least 2.
Given these constraints, Coach wants to maximize the total defensive ability of the
starting team.
Formulate an integer LP that will help him choose his starting team, and use LINDO (or
other software) to find the optimal solution.
Constraints:
1 – X3 ≥ X6 ⇔ X3 + X6 ≤ 1
X 1 ≤ X 4 & X 1 ≤ X 5 ⇒ 2 X 1 ≤ X4 + X 5
Note: the single inequality on the right is equivalent the pair of inequalities on the left if all
variables are binary. However, if they are continuous variables restricted to the interval
[0,1], the single inequality is implied by the pair on the left, but not vice-versa. In ILP, it is
better for the sake of computational efficiency to use the pair of inequalities, which gives a
smaller feasible region for the LP obtained by relaxing the integer restrictions.
X 2 + X3 ≥ 1
Maximize 3 X 1 + 2 X2 + 2 X3 + X4 + 2 X 5 + 3 X6 + X 7
LINDO output:
MAX 3 X1 + 2 X2 + 2 X3 + X4 + 2 X5 + 3 X6 + X7
SUBJECT TO
Solution:
LP OPTIMUM FOUND AT STEP 17
OBJECTIVE VALUE = 9.71428585