Scribd
Upload
316 views3 pages

5 - Assignment - Lecture 8

The ACC wants to assign four teams of officials to four basketball games to minimize total travel distance. Each game requires one team. The distances between each official team's location and each game site are provided. This can be modeled as a linear programming problem to determine the optimal assignment of officials to games and minimize the total mileage of 450.

Uploaded by

Siddharth Singh Tomar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
316 views3 pages

5 - Assignment - Lecture 8

The ACC wants to assign four teams of officials to four basketball games to minimize total travel distance. Each game requires one team. The distances between each official team's location and each game site are provided. This can be modeled as a linear programming problem to determine the optimal assignment of officials to games and minimize the total mileage of 450.

Uploaded by

Siddharth Singh Tomar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Q 1 (The ACC Basketball). The Atlantic Coast Conference (ACC) has four basketball games on a particular night.

The conference office wants to assign four teams of officials to the four
games in a way that will minimize the total distance traveled by the officials. The supply is always one team of officials, and the demand is for only one team of officials at each game. The
distances in miles for each team of officials to each game location are shown in the following table:

subject to
Game Sites XAR + XAA + XAD + XAC = 1
Officials Raleigh Atlanta Durham Clemson XBR + XBA + XBD + XBC = 1
A 210 90 180 160 XCR + XCA + XCD + XCC = 1
B 100 70 130 200 XDR + XDA + XDD + XDC = 1
C 175 105 140 170 XAR + XBR + XCR + XDR = 1
D 80 65 105 120 XAA + XBA + XCA + XDA = 1
XAD + XBD + XCD + XDD = 1
XAC + XBC + XCC + XDC = 1
The linear programming formulation of the assignment model is similar to the formulation of the Xij ≥ 0
transportation model, except all the supply values for each source equal one, and all the demand
values at each destination equal one. Thus, our example is formulated as follows:
This is a balanced assignment model. An unbalanced model exists when supply
exceeds demand or demand exceeds supply.

Minimize Z = 210XAR + 90XAA + 180XAD + 160XAC + 100XBR + 70XBA + 130XBD + 200XBC + 175XCR +
105XCA + 140XCD + 170XCC + 80XDR + 65XDA + 105XDD + 120XDC
Q 1. The ACC Basketball

Game Sites Teams Teams


Officials Team Raleigh Atlanta Durham Clemson Available Assigned
A 1 0
B 1 0
C 1 0
D 1 0 C5+D5+E5+F5
Teams Demanded 1 1 1 1 4 0
Teams Assigned 0 0 0 0
Total Mileage = 0
D5+D6+D7+D8
Mileage
Game Sites
Officials Team Raleigh Atlanta Durham Clemson Decision variables, C5:F8
A 210 90 180 160
B 100 70 130 200
C 175 105 140 170 Mileage array
D 80 65 105 120
Q 1. The ACC Basketball

Game Sites Teams Teams


Officials Team Raleigh Atlanta Durham Clemson Available Assigned
A 0 1 0 0 1 1
B 1 0 0 0 1 1
C 0 0 1 0 1 1
D 0 0 0 1 1 1 C5+D5+E5+F5
Teams Demanded 1 1 1 1 4 4
Teams Assigned 1 1 1 1
Total Mileage = 450
D5+D6+D7+D8
Mileage
Game Sites
Officials Team Raleigh Atlanta Durham Clemson Decision variables, C5:F8
A 210 90 180 160
B 100 70 130 200
C 175 105 140 170 Mileage array
D 80 65 105 120

You might also like