Course : Operation Researches (English)

Prof : Ali ABDALLAH

Management and Economic Year : 2nd - 1st session Spring (2022-2023)
Sciences School Duration : 90 minutes
Date: 06/06/2023
2022-2023 ‫اﻹﻣﺘﺤﺎن اﻟﻨﮭﺎﺋﻲ ﻟﻠﻔﺼﻞ اﻷول ﻟﻠﻌﺎم اﻟﺪراﺳﻲ‬

I. Two products P1 and P2 are manufactured by passing sequentially through three machines.
Time allocated to the products to each machine (M1, M2, M3) is limited to 600 min per day.
The production time and profit per unit of each product are:

Product Minutes per unit Profit

Machine 1 Machine 2 Machine 3
1 10 6 8 $2
2 5 20 15 $3
Formulate the mathematical LP model of the problem. (8 pts)

X1: # unit P1
X2: # units P2
Max z= 2x1+3x2
s.t.
10x1+5x2 <= 600
6x1+20x2 <=600
8x1+15x2 <= 600
X1,x2 >=0

II. Maximize the following economic function using graphical method: (14 pts)
Max Z = 2x1 + 3x2
S.t.
B(0,30
x1 + x2 ≤ 30
2x1 + 5x2 ≥ 50
x1 , x2 ≥ 0

Feasable
Za= 30 Region
Zb =90
Zc =60
Zd =50 C(30,0
Opt Z=90 is at B;
for x1=0 and x2=30 A(0,10

D(25,0

III. Minimize the following function using Dual of Simplex Method (16 pts)

Min Z = 4x1 + 2x2 z- 4x1 -4x2 =0

S.t.
3x1 + 4x2 ≤ 18 3x1 +4x2 +s1 = 18
(-1) x 4x1 + 5x2 ≥ 20 -4x1-5x2 +s2 = 20
x1 , x2≥ 0

1/4
 x1 X2 S1 S2 sol
S1 3 4 1 0 18
S2 -4 -5 0 1 -20
Z -4 -2 0 0 0

x1 X2
Coef. z -4 -2
Coef. PL -4 -5
ratio 1 2/5

S2 leaves; x2 enters
x1 X2 S1 S2 sol
S1 -1/5 0 1 4/3 2
X2 4/5 1 0 -1/5 4
Z -12/5 0 0 -2/5 8

Optimal and feasible.

IV. (10 pts) Assignment problem: A factory has 4 machines and 4 tasks to complete. Each machine must
perform (assign) a task. Implementation time is given by the following table:
The factory wants to minimize the total time of implementation. Use the Hungarian method to solve
this problem.
Solution:
T1 T2 T3 T4 min
Selecting minimum uncovered number (1 Point)
Machine 1 50 20 35 30 20
New table (1 Point) Machine 2 5 45 25 20 5
covering lines (2 Point) Machine 3 30 35 10 40 10
Detecting optimal solution (2 Point) Machine 4 5 15 25 35 5
Distribution (2 Points)
Total cost (2 Point)
30 0 15 10 30 0 15 0

0 40 20 15 0 40 20 5

20 25 0 30 20 25 0 20

30 0 10 20 20
0 10 20
m = 3 not 4
Min 0 0 0 10
0 T1 T2 T3 T4
35 0 20
Machine 1 35 0 20 0
0 40 20 0
Machine 2 0 40 20 0
20 25 0 15 Machine 3 20 25 0 15
0 10 20 15 Machine 4 0 10 20 15
m = 4 optimal solution

Machine Task Cost

M1 T2 20
M3 T3 10
M4 T1 5
M2 T4 20
Total cost 55

2/4
V. (6 pts) Given transportation model consisting of 5 sources (S1-S5) and 3 destinations (D1-D3). The
values filled in the table represent the transportation cost Cij per unit of product.
D1 D2 D3 Supply
S1 1 10 5 100
S2 2 3 4 100
S3 3 5 4 100
S4 3 2 4 120
S5 4 10 1 100
Demand 320 150 50

Write the starting feasible solution table using Least-Cost method and calculate the cost.

1 10 5
100 / /
2 3 4
100 / /
3 5 4
100 / /
3 2 4
/ 120 /
4 10 1
20 30 50
TC= 1270

VI. Find the optimal solution for the given starting feasible solution table using MODI method (14 pts).

V1= 1 V2=0 V3=2

1 10 5
U1=0 -
100 -
2 2 4
U2=1
100 - -
3 0 4
U3= 2
100 2 0
3 2 4
U4= 2
20 50 50
4 10 1
U5=-1
- - 100

V1= 1 V2= -2 V3=2

1 10 5
U1=0 -
100 -
2 2 4
U2=1
100 - -
3 0 4
U3= 2
50 50 0
3 2 4
U4= 2
70 - 50
4 10 1
U5=-1
- - 100

Optimal; TC =960

3/4
VII. (8 pts) Construct the network (graph only) of the project described below, adding fictive (dummy)
activities where needed:

Activity A B C D E F G
Predecessor(s) --- --- A A,B,F F --- E

7 act. X 0.5 point = 3.5 points; fictive 2 X 1.5= 3pts and 1.5 point for correct graph

3 C
A f1

B
D
1 4 6

f2 G
F

5
E
2

VIII. (14 pts) Given the following graph and description table for a project (activity durations are in weeks,
costs are in $ per week). Calculate using CPM

a. Es, Lc for each node (8pts)

b. the critical activities and critical path (3+2 = 5 pts)
c. Calculate the minimal total duration (1 pts)

Activity A B D E F H I J
Duration (weeks) 3 5 9 7 7 8 1 2

D
5 H

J
A I 6
E 7
1 2
4
B F

node 1 2 3 4 5 6 7
Es 0 3 8 10 9 Max(17,11,15) 19
=17
Lc 0 Min(9,5)=5 10 16 9 17 19

Critical Activities; D, H and J

Critical Path in Green; Total duration: 19 weeks
4/4