CIVL 2170 - Infrastructure Systems Engineering and Management

Assignment 4 (Due date: 10 March 2024) Spring 2024

Name: lam kin Wang

Student ID： 20954219 .

Question 1:

An contractor wants to assign six veteran workers to seven new jobs. Each worker can only work
on 1 job and each job should receive no more than 1 worker. The amount of profit that each worker
can earn for the employer by doing each of the job is listed as below:

Job Job 1 Job 2 Job 3 Job 4 Job 5 Job 6 Job 7

Worker
Worker A 75 20 60 15 35 30 40

Worker B 40 50 30 45 20 40 30

Worker C 60 30 50 20 25 35 50

Worker D 35 75 60 25 20 25 20

Worker E 55 30 20 35 65 40 40

Worker F 55 35 25 20 30 35 60

This contractor wants you to help her find the optimal assignment solution to maximize the
total profit. Please formulate the above problem. Write the objective function and all the
constraints. You need to clearly define all the decision variables and explain the physical
meanings of the objective function and all the constraints. You do not need to solve it.

Solution:
decis ion var
:
λ A, ,
\n ;
,

λ ci ,
Xx: , XE : ,
λf ! i= 1 ,
2
,
"
…
,
A) ota ( 42 rav ,

E A 5 XA 、 20 X⽇ z t G0 XA 3 15 XA 4 435 3OXA 6 4 OXA2 ⼗

Objectivre function t λA5
=

: MUX + + +

4OXB ( + 50 XB2 + 30 XB3 + H5 XB4 + 20 XB5 440 ☆ Bo ⼗分 OXB> ⼗

60 xc 1 t 3 OXcc + 5OXcs + 20 Xc4 + 25λ c5 + 号 5xc 6 + 50 Xcz +

35 B 1+ 5 XBc +60X 33 +25 X 74+2 ☆

XD 5 +25XDc +20
+
xz

55 XE 1 ⼗ 3OXE 2 + 204 E3 35X E4 + 65 λE 5 HOXE 6

4
+ + 40 ×E 的⼗
55 XFl t 35 XFz + 25 F3 + IOXF 4+ 3 OXF5+ 35XF/ + 60 XFa +

Oxd 1 + OXd 、 t OXa 3 t OXd + + OXd 5 + OXa 6 + Oxx

(i 1 A }
…
= 2
,
茅 XD =
1 , ,
!
Constraint fumctiom :
÷ XA : =|
冬 XEi
1
=

亭 ×B ; = 1
1
敦 Fi =

予× (
÷Xa
1
= =
ci :

A, B C( D/ E , F, ⼭ )
号 X; 4
= 1
Cj =
,

亭 ×;
1
=
1
{

÷ X;
=
5
l
亭 X;z =

容 ; 6
* = 1

亭 ×js
l

=
1
亭 Xs ^=

xij = o
or
1 Vi j ,
 Question 2:

A building owner plans to purchase air-conditioners for five office buildings. The demands of
the five office buildings are 50 units, 30 units, 50 units, 30 units, and 40 units, respectively.
Seller I and Seller II can supply air-conditioners to five office buildings, and they need to order
air-conditioners from two air-conditioner producers, P1 and P2. The available number of air-
conditioners that each producer can supply is 100.

The unit costs offered by producers to sellers are:

Unit cost Seller I Seller II

P1 60 70

P2 80 50

The unit transportation and installation costs from sellers to office buildings are:

Unit cost A B C D E

Seller I 25 30 20 20 10

Seller II 40 15 20 25 20

Please formulate a LP model to minimize the total cost of the air-conditioner supply. You need
to clearly define all the decision variables and explain the physical meanings of the objective
function and all the constraints. You do not need to solve it.

Solution:

Supply = 100 + 100 = 200

} Demaud =
spp
Demand = 50+ 30 + 50 + 30 +40 = 200

decisiom var .
:
X 13 ,
X,4
,
X 23
,
X 24 , Xsi , Xai ( i = A , B, , D ,
(
E
)fotal 14 var. constraint function : X 13 + X ,4 = 100

X23 + X24 = 100

fudction m' nz 60 × s+
⼦0 X , t + 80 X 23 + 50 X24 +
Objectire
: =
.

25 X3A + 3OX 33 + DX 3 C + DX 3D + 1 OX3E ⼗ X 13 + X2 X 3A X3 -X 3 -X 3

} B -X 3 =
-

E
-
D
c

4O X4A + 15X41B + 20 X 4c + 25 X40 + DX4

E
X . 4 + X24
-
X4A -

XaB -
X4 L -X -X4
4 E=
D

X 3A + X4 A =5

X 3⽇ + X4 B =
30

Xsc tX4<= 50

X3D + X 4D = 30

X3E 4 X4E = 40

X1 s , 14 (i= )
2 ,
23
,
24 3 i
, ,
4! ≥0 AB ,
C
,
D, E
Question 3:

Consider a city with the following simplified airline networks. Each node represents an airport.
The travel times of arcs connecting two airports are presented in the graph below. A
businessman at airport 1 plans to travel to airport 7. He is trying to find out the best travel route
to minimize the total travel time.

(a) Please formulate this problem with LP formulation. You need to clearly define all the
decision variables and explain the physical meanings of the objective function and all the
constraints.

(b) Solve this problem using Dijkstra’s Algorithm. (Table Format)

Solution:

delision Var : X. 2 , X 23 24 25 1 X3 36 1 X 41 , 46 ,47 1 X54 1 Xo ,O ] X25

, 14 ,
, , 5

= 3 X , 2 +4 X 14 + 4 + 3 X24 +2 X25 6 X 36 +
objectivefunctiou : min z
Xa 3 +2Xs +

4X43 + 2X40 + 6 X42 + X54 + 4X0 ; t 5 X67 + 5X55

coustraintfanctiou : X2 + X , 4 =
1

X +5 -
X46 -
X 67 =
-
1

Xz 3 + X24 + Xa + -X 2 =

X31 +X 36 -X23 -X 43 =

X43 + X46 + X47 -

X, 4
-X24 -X54 =

X54 X
25- X05 -Xa 5 =

= 0
X65 + X07 - X30 - X46

X25 =

Xrs , 24 X 31, 36 1X 3
X .2 ,
14 9 , 05 ,
43 , 40 ,47 1X 54 1X5 , 0 ⼦ 1 X25 20

or
Xij = 0
 @
了 4 ∞
是⼀
∞
l 1
⼀

3 ⼦ 4 5 ∞

2 |
2 . 2
* —

4 了
1
⼦
2 41 台年 10
4

5 个 五个台 G 1
φ

了 ⼦ 5 6 9
6 |

2 4 2 4 6

了 ⼦ 4 元 9
了 |
2 1 4 6

3 5 6
9

6 ⼦ . 三 台 2 4 6

! .
Shortest Path : 1 → 4 6
→
→ 7 , min t = G
unietiome