Assignment Problem

The coach of a swim team needs to assign swimmers to a 200-yard

medley relay team (four swimmers, each swims 50 yards of one of the
four strokes). Since most of the best swimmers are very fast in more
than one stroke, it is not clear which swimmer should be assigned to
each of the four strokes. The five fastest swimmers and their best
times (in seconds) they have achieved in each of the strokes (for 50
yards) are shown below.

Backstroke Breaststroke Butterfly Freestyle

Carl 37.7 43.4 33.3 29.2
Chris 32.9 33.1 28.5 26.4
David 33.8 42.2 38.9 29.6
Tony 37.0 34.7 30.4 28.5
Ken 35.4 41.8 33.6 31.1
1
Question: How should the swimmers be assigned to make the fastest relay team?
 Assignment Problem
Let xij = 1 if swimmer i swims stroke j; 0 otherwise
tij = best time of swimmer i in stroke j

Minimize Time = ∑ i ∑ j tij xij

subject to

each stroke swum: ∑ i xij >= 1 for each stroke j

each swimmer swims 1: ∑ j xij ≤ 1 for each swimmer i

and
xij ≥ 0 for all i and j.

2
10. Assignment problem

301 302 303 304 305

M1 5 4 3
M2 2 5 4 3
M3 4 1 5 3 2
M4 5 2 3 4
M5 5 4 3
The objective function :

Maximize
Z=(5X12+4X13+3X14)+(2X21+5X22+4X24+3X25)+(4X31
+X32+5X33+3X34+2X35)+(5X42+2X43+3X44+4X45)+
(5X51+4X52+3X53)

Subject to
5
Σ Xij<=1 for every i=1,2,3,4,5
j=1
5
Σ Xij<=1 for every j=1,2,3,4,5
j=1
Xij={0,1}
Xij’s>=0 (Non negativity)
 Transportation Problem

A company has two plants producing a certain product that is

to be shipped to three distribution centers. The unit
production costs are the same at the two plants, and the
shipping cost per unit is shown below. Shipments are made
once per week. During each week, each plant produces at
most 60 units and each distribution center needs at least 40
units. Distribution Center
1 2 3
A $4 $6 $4
Plant
B $6 $5 $2
Question: How many units should be shipped from each plant to each
5
distribution center?
 Transportation Problem
Let xij = units to ship from plant i to distribution center j (i = A, B; j = 1, 2, 3),

Minimize Cost = $4xA1 + $6xA2 + $4xA3 + $6xB1 + $5xB2 + $2xB3

subject to
Plant A: xA1 + xA2 + xA3 ≤ 60
Plant B: xB1 + xB2 + xB3 ≤ 60
Distribution Center 1: xA1 + xB1 ≥ 40
Distribution Center 2: xA2 + xB2 ≥ 40
Distribution Center 3: xA3 + xB3 ≥ 40
and
xij ≥ 0 (i = A, B; j = 1, 2, 3). And Integer

6
 The Big M Distribution-
Network Problem
 The Big M Company produces a variety of heavy duty
machinery at two factories. One of its products is a large
turret lathe.
 Orders have been received from three customers for the
turret lathe.
Question: How many lathes should be shipped from each
factory to each customer?

7
Some Data

Shipping Cost for Each Lathe

Customer Customer Customer
To
1 2 3
From Output
Factory 1 $700 $900 $800 12 lathes
Factory 2 800 900 700 15 lathes
Order Size 10 lathes 8 lathes 9 lathes

8
The Distribution Network
C1 10 lathes
needed
$700/lathe

12 lathe F1
produced
$900/lathe

$800/lathe
C2 8 lathes
needed
$800/lathe $900/lathe

15 lathes F2
produced

$700/lathe
C3 9 lathes
needed

9
 The Big M Distribution-
Network Problem
Let Sij = Number of lathes to ship from i to j (i = F1, F2; j = C1, C2, C3).

Minimize Cost = $700SF1-C1 + $900SF1-C2 + $800SF1-C3

+ $800SF2-C1 + $900SF2-C2 + $700SF2-C3
subject to
Factory 1: SF1-C1 + SF1-C2 + SF1-C3 =< 12
Factory 2: SF2-C1 + SF2-C2 + SF2-C3 =< 15
Customer 1: SF1-C1 + SF2-C1 >= 10
Customer 2: SF1-C2 + SF2-C2 >= 8
Customer 3: SF1-C3 + SF2-C3 >= 9
and
Sij ≥ 0 (i = F1, F2; j = C1, C2, C3). And Integer

10
 Assignment 1: Question 7
Period 1 Period 2 Period 3 Period 4 SUPPLY
Period 1 Normal X11 (6) X12 (7.5) X13 (9) X14 (10.5) 100
overtime X11O (8) X12O (9.5) X13O (11) X14O (12.5) 60
Period 2 Normal X22 (4) X23 (5.5) X24 (7) 100
overtime X22O (6) X23O (7.5) X24O (9) 65
Period 3 Normal X33 (8) X34 (9.5) 100
overtime X33O (10) X340 (11.5) 70
Period 4 Normal X44 (9) 100
overtime X44O (11) 60
Beginning I1 (0) I2 (1.5) I3 (3) I4 (4.5) 15
Inventory
DEMAND 130 80 125 195

Note: The number in the bracket represents the

unit cost for the cell
I1, I2, I3, I4 are the number of units consumed from the beginning
inventory (I0=15) in subsequent period and
I1+I2+I3+I4=I0=15=beginning inventory
Beginning inventory constraint
Supply constraint with normal
production for period 1,2,3,4
Supply constraint with Overtime
production for period 1,2,3,4
Demand constraint
for period 1-4
(assuming each
demand met
exactly)
Net inventory
constraint
where Inet1
implies
inventory at
 11.Transshipment problem

Let the decision variables are

Xij=Quantity moving from factory i to warehouse j for every i=1,2 j=1,2,3
Yji=Quantity moving from warehouse j to factory i
Wij=Quantity moving between warehouse i to warehouse j
Fij=Quantity moving
i between factory j to factory i

W1

F1

F2 W3
The objective function :
Minimize Z=(2X11+6X12+30X13)+(6X21+10X22+50X23)+
(6Y11+30Y12)+(50Y21+6Y22)+ (90Y31+110Y32)+(46W12+2W13)+
(2W21+6W23)+(130W31+6W32)+(130F12+2F21)

Subject to the constraint

At factory 1:
(Y11+Y21+Y31+F21)+150>=(X11+X12+X13+F12)
At factory 2:
(X21+X22+X23++F21)-(Y12+Y22+Y32+F12)<=300
A warehouse 1:
(X11+X21+W21+W31)-(Y11+Y12+W12+W13)>=150
At warehouse 2:
(X12+X22+W12+W32)-(Y21+Y22+W21+W23)>=150
At warehouse 3:
(X13+X23+W13+W23)-(Y31+Y32+W31+W32)>=150
where Xij>=0,Wij>=0,Yij>=0 & Fij>=0
f2f1=300,f1w1=300,f1w2=150,w1w3=150

W1

F1
W2

F2 W3
 Question 9 (PRODUCTION Scheduling problem 2)
•Upto the beginning what ever production cost is incurred should not be considered
•Waste cost 25 includes production cost of 15 and the disposal cost of 10
Period 2 period 3 period 4 period 5 period 6 period 7 period 8 SUPPLY
stock used X13 (0)
stock
period 1 waste W12 W13 (25-15=10) 2000
stock used X23 (0) X24 (0.75)
stock
period 2 waste W22 W23 (25-15=10) W24 (10.75) 1000
stock used X33 (15) X34 (15.75) X35 (16.5)
stock
period 3 waste W33 (25) W34 (25.75) W35 (26.5) 8000
stock used X44 (15) X45 (15.75) X46 (16.5)
stock
period 4 waste W44 (25) W45 (25.75) W46 (26.5) 8000
stock used X55 (15) X56 (15.75) X56 (16.5)
stock
period 5 waste W55 (25) W56 (25.75) W57 (26.5) 8000
stock used X66 (15) X67 (15.75) X68 (16.5)
stock
period 6 waste W66 (25) W67 (25.75) W68 (26.5) 8000
stock used X77 (15) X78 (15.75)
stock W78
period 7 waste W77(25) (25.75) 8000
stock used X88 (15)
stock
period 8 waste W88 (25) 8000

DEMAND 5000 6000 6500 7000 8000 95000

min
0X13+10W13+0X23+10W23+0.75X24+10.75W24+15X33+15.75X34+16.5X35+25W33+25.7
5W34+26.5W35+15X44+15.75X45+16.5X46+25W44+25.75W45+26.5W46+15X55+15.75X5
6+16.5X57+25W55+25.75W56+26.5W57+15X66+15.75X67+16.5X68+25W66+25.75W67+26
.5W68+15X77+15.75X78+25W77+25.75W78+15X88+25W88
ST
X3-X33-X34-X35-W33-W34-W35=0
X4-X44-X45-X46-W44-W45-W46=0 Defining Xi=quantity produced in on
X5-X55-X56-X57-W55-W56-W57=0
X6-X66-X67-X68-W66-W67-W68=0
X7-X77-X78-W77-W78=0
X8-X88-W88=0
X3<=8000
X4<=8000
X5<=8000
X6<=8000
Supply constraint for period 3-8
X7<=8000
X8<=8000

Where Xij is the quantity produced in ‘i’ month for consumption in ‘j’ mon
Wij is the quantity produced in ‘i’ month and has become waste at the end
X13+X23+X33=5000
X24+X34+X44=6000
X35+X45+X55=6500 Demand constraint for period 3-8
X46+X56+X66=7000
X57+X67+X77=8000
X68+X78+X88=9500
W12=940
W13+W12+X13=2000
W22=110
W23+0.47W22+0.47X23=470
W24+W22+W23+X23+X24=1000
W33+0.11X33-0.11X3=0
W34+0.47X33+0.47W33+0.47X34-0.47X3=0
W44+0.11X44-0.11X4=0
W45+0.47X44+0.47W44+0.47X45-0.47X4=0 Waste constraint (this
W55+0.11X55-0.11X5=0 includes the initial
W56+0.47X55+0.47X56+0.47W55-0.47X5=0
W66+0.11X66-0.11X6=0
inventory constraint
W67+0.47X66+0.47X67+0.47W66-0.47X6=0
W77+0.11X77-0.11X7=0
W78+0.47X77+0.47X78+0.47W77-0.47X7=0
W88+0.11X88-0.11X8=0
Xij>=0 and wij>=0