9.2 Sports Scheduling: An Introduction to Integer Optimization

9.2 Sports Scheduling: An Introduction to Integer Optimization

Quick Question

 

Suppose we had two more teams in our tournament (for a total of 6 teams). Each division would have 3 teams. So each team plays two teams twice (the teams in their division), and each team plays three teams once (the teams in the other division). This means that the tournament will last for 7 weeks. How many decision variables would we have?

Exercise 1

 Numerical Response 

 

Explanation

We would have 105 decision variables because we have 7 weeks, and 15 different pairs of teams.

How many constraints would we have? Don’t include the constraints that force the variables to be binary when counting the constraints here. (HINT: We would have 6 division constraints, since each pair in each division needs to play twice.)

Exercise 2

 Numerical Response 

 

Explanation

We would have 6 division constraints, 9 non-division constraints (each of the three teams in one division has to play each of the three teams in the other division), and 42 constraints to make sure each team only plays one team each week (6 teams times 7 weeks).

CheckShow Answer

Course Info

Learning Resource Types

theaters Lecture Videos
notes Lecture Notes
assignment_turned_in Problem Sets with Solutions