Clients

Plants D1 D2 D3 D4 Plants

Clifton Springs 32 34 32 40 Clifton Springs

Danville 34 30 28 38 Danville

NA 0 0 0 0 NA

Objective 282000

C1 5000 <= 5000

Obj: Max
C2 3000 <= 3000 32 X11+ 34 X12+ 32 X13+ 40 X14
X23+ 38 X24+ 0 X31+ 0 X32+ 0 X
C3 4000 <= 4000
Subject to constraints:
C4 2000 = 2000 X11+ X12+ X13+ X14 <= 5000
X21+ X22 +X23+ X24 <= 3000
C5 5000 = 5000 X31+ X32 +X33+ X34 <= 4000
X11+ X21+ X31 = 2000
C6 3000 = 3000 X12+ X22+ X32 = 5000
X13+ X23+ X33 = 3000
C7 2000 = 2000 X14+ X24+ X34 = 2000
Non negative constraints

Customer D2's demand will fall short by 1000 units.

Customer D3's demand will not be met at all, hence falling short of all 3000
units.
 Clients

D1 D2 D3 D4

0 4000 0 1000 5000

2000 0 0 1000 3000

0 1000 3000 0 4000

2000 5000 3000 2000

Supply
ax
1+ 34 X12+ 32 X13+ 40 X14+ 34 X21+ 30 X22+ 28
38 X24+ 0 X31+ 0 X32+ 0 X33+ 0 X34
C.S.
t to constraints:
X12+ X13+ X14 <= 5000
5000
X22 +X23+ X24 <= 3000
X32 +X33+ X34 <= 4000
X21+ X31 = 2000
X22+ X32 = 5000
X23+ X33 = 3000 40
X24+ X34 = 2000
gative constraints

ts.
Dan
3000
ce falling short of all 3000

DUM
4000
Dummy
 4000
Dummy
 Demand

D1 2000

32

C.S.
34

32

40
5000
D2
34

30
Dan

28

38

0 D3
0 3000

DUM 0

0
0

2000
D4
 Customer
Distributor Boston Dallas LA St. Paul NA Distributor
Denver 7 11 8 13 0 Denver
Atlanta 20 17 12 10 0 Atlanta
Chicago 8 18 13 16 0 Chicago

Objective: 4240
C1 100 <= 100 Obj: Max
C2 100 <= 100 7 X11+ 11 X12+ 8 X13+ 13 X14+ 0 X15+ 20 X21
C3 150 <= 150 X25+ 8 X31+ 18 X32+ 13 X33+ 16 X34+ 0 X35
C4 50 = 50
C5 70 = 70 Subject to constraints:
C6 60 = 60 X11+ X12+ X13+ X14+ X15 <= 100
C7 80 = 80 X21+ X22 +X23+ X24+ X25 <= 100
C8 90 = 90 X31+ X32 +X33+ X34+ X35 <= 150
X11+ X21+ X31 = 50
X12+ X22+ X32 = 70
X13+ X23+ X33 = 60
X14+ X24+ X34 = 80
X15+ X25+ X35 = 90

The optimal solution is 4240.

 Customer
Boston Dallas LA St. Paul NA
0 0 0 10 90 100
50 50 0 0 0 100
0 20 60 70 0 150
50 70 60 80 90 7
100
Denver 11

+ 8 X13+ 13 X14+ 0 X15+ 20 X21+ 17 X22+ 12 X23+ 10 X24+ 0 8

8 X32+ 13 X33+ 16 X34+ 0 X35
13
raints:
3+ X14+ X15 <= 100 20
3+ X24+ X25 <= 100
3+ X34+ X35 <= 150 100 17
1 = 50 Atlanta
2 = 70 12
3 = 60
4 = 80 10
5 = 90
8
18

150 Chicago 13

16
 Boston 50

11

Dallas 70
20

17

12

L.A. 60
18

13

16

S.P. 80
 Product Product
Machine A B C NA Machine A B
1 1 1.2 0.9 0 1 500 500
2 1.3 1.4 1.2 0 2 1500 0
3 1.1 1 1.2 0 3 0 0
2000 500

Objective: 4430 Obj: Max

C1 1500 <= 1500 1 X11+ 1.2 X12+ 0.9 X13+ 0 X14+ 1.3 X21+ 1.4 X22+ 1.2
C2 1500 <= 1500 0 X24+ 1.1 X31+ 1 X32+ 1.2 X33+ 0 X34
C3 1000 <= 1000 Subject to constraints:
C4 2000 = 2000 X11+ X12+ X13+ X14 <= 1500
C5 500 = 500 X21+ X22 +X23+ X24 <= 1500
C6 1200 = 1200 X31+ X32 +X33+ X34 <= 1000
C7 300 = 300 X11+ X21+ X31 = 2000
X12+ X22+ X32 = 500
X13+ X23+ X33 = 1200
X14+ X24+ X34 = 300
 Product
C NA
200 300 1500
0 0 1500
1000 0 1000
1200 300

4+ 1.3 X21+ 1.4 X22+ 1.2 X23+

3+ 0 X34
 JOBS JOBS
Crew 1 2 3 4 5 Crew 1 2
Red 30 44 38 47 31 Red 0 0
White 25 32 45 44 25 White 0 0
Blue 23 40 37 39 29 Blue 0 0
Green 26 38 37 45 28 Green 1 0
Brown 26 34 44 43 28 Brown 0 1

Objective: 162
C1 1 >= 1
C2 1 >= 1
Obj: Min.
C3 1 >= 1
C4 1 >= 1 X11+ 44 X12+ 38 X13+ 47 X14+ 31 X15+ 25 X21+ 3
C5 1 >= 1 X23+ 44 X24+ 25 X25+ 23 X31+ 40 X32+ 37 X33+ 3
C6 1 = 1 X35+ 26 X41+ 38 X42+ 37 X43+ 45 X44+ 28 X45+ 2
C7 1 = 1 X52+ 44 X53+ 43 X54+ 28 X55
C8 1 = 1
C9 1 = 1 Subject to constraints:
C10 1 = 1
X11+ X12+ X13+ X14+ X15 >= 1
X21+ X22 +X23+ X24+ X25 >= 1
X31+ X32 +X33+ X34+ X35 >= 1
X41+ X42 +X43+ X44+ X45 >= 1
X51+ X52 +X53+ X54+ X55 >= 1
X11+ X21+ X31+ X41+ X51 = 1
The minimum cost is 162. X12+ X22+ X32+ X42+ X52 = 1
X13+ X23+ X33+ X43+ X53 = 1
X14+ X24+ X34+ X44+ X54 = 1
X15+ X25+ X35+ X45+ X55 = 1

Non negative constraints

 JOBS
3 4 5
1 0 0
0 0 1
0 1 0
0 0 0 30
0 0 0
1 44
Red
38
3 47
1
7 X14+ 31 X15+ 25 X21+ 32 X22+ 45 2
23 X31+ 40 X32+ 37 X33+ 39 X34+ 29 5
37 X43+ 45 X44+ 28 X45+ 26 X51+ 34 32
28 X55 1 Whit
e 45
44
2
X15 >= 1 5
X25 >= 1 2
X35 >= 1 3 40
X45 >= 1
X55 >= 1 37
1 Blue
X51 = 1 39
X52 = 1
X53 = 1 29
X54 = 1
X55 = 1 2
6 38

37
1 Green
45
28

2 34
6
44

1 Brow 43
n
28
1 1

2 1

3 1

4 1

5 1
 Distribution hub Distribution hu
Bidder 1 2 3 4 Bidder 1
Martin Products 190 175 125 230 Martin Products 0
Schmidt Products 150 235 155 220 Schmidt Products 1
Miller Containers 210 225 135 260 Miller Containers 0
D&J Burns 170 185 190 280 D&J Burns 0
Larbes Furnishings 220 190 140 240 Larbes Furnishings 0
Lawler Depot 270 200 130 260 Lawler Depot 0

Objective: 695
C1 1 <= 1 Obj: Min
C2 1 <= 1 190 X11 + 175 X12+ 125 X13+ 230 X14+ 150 X
C3 0 <= 1 X24+ 210 X31+ 225 X32+ 135 X33+ 260 X34+
X43+ 280 X44+ 220 X51+ 190 X52+ 140 X53+
C4 0 <= 1
X62+ 130 X63+ 260 X64
C5 1 <= 1 Subject to constraints:
C6 1 <= 1
C7 1 = 1 X11+ X12+ X13+ X14 <= 1
C8 1 = 1 X21+ X22 +X23+ X24 <= 1
C9 1 = 1 X31+ X32 +X33+ X34 <= 1
C10 1 = 1 X41+ X42 +X43+ X44 <= 1
X51+ X52 +X53+ X54 <= 1
X61+ X62 +X63+ X64 <= 1
X11+ X21+ X31+ X41+ X51+ X61 = 1
X12+ X22+ X32+ X42+ X52+ X62 = 1
X13+ X23+ X33+ X43+ X53+ X63 = 1
X14+ X24+ X34+ X44+ X54+ X64 = 1

Non negative constraints

Schmidt products to supply to distribution hub1.
Martin products to supply to distribution hub 2.
Lawler depot to supply to distribution hub 3.
Larbes furnishings to supply to distribution hub 4.
 Distribution hub
2 3 4
1 0 0
0 0 0
0 0 0
0 0 0
0 0 1
0 1 0

+ 125 X13+ 230 X14+ 150 X21+235 X22+155 X23+ 220

5 X32+ 135 X33+ 260 X34+ 170 X41+ 185 X42+ 190
0 X51+ 190 X52+ 140 X53+ 240 X54+ 270 X61+ 200
0 X64
ts:

X14 <= 1
X24 <= 1
X34 <= 1
X44 <= 1
X54 <= 1
X64 <= 1
X41+ X51+ X61 = 1
X42+ X52+ X62 = 1
X43+ X53+ X63 = 1
X44+ X54+ X64 = 1

aints
Hourly charges charged by each consultant for each client project

Client / Client /
A B C D
Consultant Consultant
Avery 100 125 115 100 Avery
Baker 120 135 115 120 Baker
CampBell 155 150 140 130 CampBell

Subject to Constraints

Objective: 57925

C1 140 <= 160

C2 160 <= 160
C3 140 <= 140
C4 180 = 180
C5 75 = 75
C6 100 = 100
C7 85 = 85

1. Avery should work for Client B for 40 hours and for Client C, it should work
for 100 hours
2. Baker should work for Clients A, B , D for 40, 35 and 85 hours respectively
3. Campbell should just work for Client A for 140 hours

This schedule will get the firm in maximizing the total billing to $57925
 A B C D

0 40 100 0 160
40 35 0 85 160
140 0 0 0 140
180 75 100 85

Obj: Max
100 X11+ 0 X12+ 115 X13+ 100 X14+ 120 X21+ 135 X22+ 115 X23+ 120 X24+ 155 X31+ 150
X32+ 140 X33+ 130 X34
Subject to constraints:
X11+ X12+ X13+ X14 <= 160
X21+ X22 +X23+ X24 <= 160
X31+ X32 +X33+ X34 <= 140
X11+ X21+ X31 = 180
X12+ X22+ X32 = 75
X13+ X23+ X33 = 100
X14+ X24+ X34 = 85
Non negative constraints

uld work

ectively

5
Hourly charges charged by each consultant for each client project

Client / Client /
A B C D
Consultant Consultant
Avery 100 0 115 100 Avery
Baker 120 135 115 120 Baker
CampBell 155 150 140 130 CampBell

Subject to Constraints Obj: Max

100 X11+ 0 X12+ 115 X13+ 100 X14+ 120 X21+ 135 X2
Objective: 57525 120 X24+ 155 X31+ 150 X32+ 140 X33+ 130 X34
Subject to constraints:
C1 140 <= 160 X11+ X12+ X13+ X14 <= 160
C2 160 <= 160 X21+ X22 +X23+ X24 <= 160
C3 140 <= 140 X31+ X32 +X33+ X34 <= 140
X11+ X21+ X31 = 180
C4 180 = 180
X12+ X22+ X32 = 75
C5 75 = 75 X13+ X23+ X33 = 100
C6 100 = 100 X14+ X24+ X34 = 85
C7 85 = 85 Non negative constraints
 A B C D

0 0 100 40 160
40 75 0 45 160
140 0 0 0 140
180 75 100 85

X14+ 120 X21+ 135 X22+ 115 X23+

0 X33+ 130 X34