Assignment Problem

Cost
Person 1
Person 2
Person 3

Task 1
40
72
24

Task 2
47
36
61

Task 3
80
58
71

Assignment
Person 1
Person 2
Person 3

Task 1
0
0
1

Task 2
1
0
0

Task 3
0
1
0

Persons Assigned

1
=
1

1
=
1

1
=
1

Demand

Tasks Assigned
1
1
1

=
=
=

Supply
1
1
1

Total Cost
129

Capital Investment
Investment

One

Two

Three

Four

Five

Six

Seven

Profit

42

47

21

36

18

33

45

Capital
One or Two
Three or Four
Only Six, Seven, If Five

12
1
0
0

10
1
0
0

15
0
1
0

7
0
1
0

14
0
0
-2

18
0
0
1

16
0
0
1

Yes/No

47
1
1
-1

50
1
1
0
Total Profit
146

Maximum Flow Problem

From
S
S
S
A
A
B
B
C
C
C
D
E

To
A
B
C
C
D
C
E
D
E
T
T
T

Maximum Flow

Flow
4
2
6
2
2
0
2
1
3
4
3
5
12

Capacity
4
2
8
5
2
6
9
1
3
4
7
5

Nodes
S
A
B
C
D
E
T

Net Flow
12
0
0
0
0
0
-12

A
4

5
8

=
=
=
=
=

1
C

2
B

Supply/Demand
0
0
0
0
0

3
E

Cycle Trader
Unit Profit

Bicycles

Mopeds

Child Seats

100

300

50

Capital
Storage

300
0.5

1200
1

120
0.5

Order Size

Bicycles
94

Mopeds
54

Child Seats
0

Resources
Used
93000
101

Resources
Available

93000
101

Total Profit
25600

Shortest Path Problem

From
S
S
S
A
A
B
B
C
C
C
C
C
D
D
D
E
E
E

To
A
B
C
C
D
C
E
A
B
D
E
T
A
C
T
B
C
T

Distance
4
2
8
5
2
6
9
5
6
1
3
4
2
1
7
9
3
5

Go
1
0
0
0
1
0
0
0
0
0
0
1
0
1
0
0
0
0

Total Distance

11

Nodes
S
A
B
C
D
E
T

Net Flow
1
0
0
-1
-1
1
-1

A
4

5
8

=
=
=
=
=
=
=

1
C

2
B

Supply/Demand
1
0
0
0
0
0
-1

D
7
4
3

T
5

Transportation Problem
Unit Cost
Factory 1
Factory 2
Factory 3

Customer 1
40
72
24

Customer 2
47
36
61

Customer 3
80
58
71

Shipments
Factory 1
Factory 2
Factory 3

Customer 1
0
0
200

Customer 2
100
100
0

Customer 3
0
100
100

Total In

200
=
200

200
=
200

200
=
200

Demand

Total Out
100
200
300

=
=
=

Supply
100
200
300

Total Cost
26000