MA5102 - Operational Research Techniques 1

Final Examination
Examination Instructions

The Examination contains 05 questions in 04 pages. Answer ALL questions. 30 minutes

allocated to answer each question.

All questions carry equal marks.

The maximum marks attainable are indicated in brackets.

If you have any doubt as to the interpretation of the wording of a question, make your own
decision, but clearly state it on the script.

Your answers should be handwritten, and you can submit your answer scripted by taking
photographs of those. You will get additional time to take photos of your scripts, arrange those
in the order of page numbers, and upload all as one pdf document. This additional time will
be notified by the supervisor at the exam.

Each answer script paper must be verified by placing your university ID on right top corner.

If you face any difficulty in uploading the answer scripts to moodle LMS, you are advised to
email those to supervisors email (will be notified at the exam) immediately.

Page 1 of 4
Question 01

A company makes X, Y, Z products using two (A and B) machines. To produce one unit of X,
machine A takes 50 minutes processing time and B takes 30 minutes processing time. Also, to
produce one unit of Y, A takes 24 minutes and B takes 36 minutes, and to produce one unit of
Z, A takes 20 minutes and B takes 24 minutes

The company can work with maximum of 40 hrs in A and 35 hrs in B in a week. The demand
for products in the week will be 75, 95, 80 units for X, Y and Z respectively.

How company needs to maximise the units produced of X, Y and Z in a week? Note: Fractional
units of X, Y and Z’s are possible to make.

a) Formulate this problem as a maximisation problem applying the operational research theory
you learnt. [05 marks]

b) Solving the problem using a simplex algorithm you are familiar with by showing all
iterations. [10 marks]

c) As the initial stock of a week, the company has 30 units of X, 60 units of Y and 75 units of
Z. Also, If the problem is maximising the number of units left in stock at the end of the week,
how will you change the formulation of the problem to suit the new requirements (note: you
are not expected to solve the problem) [05 marks]

Question 02

An apparel company has plants in three locations: Bangladesh, Vietnam and Sri Lanka. During
the past week the total production of a special garment type unit out of each plant has been 40,
50, and 60 units respectively. The company wants to ship 50 units to the distribution
centre in London, 25 to Glasgow, 35 to Cardiff, and 40 Dundee. The unit production and
distribution costs from a plant to a distribution centre are given separately.
London Glasgow Cardiff Dundee
Bangladesh 10 5 12 8
Vietnam 12 4 12 10
Sri Lanka 8 10 5 6

a) Solve this transportation problem using Modified Distribution method by showing the
necessary calculation steps. [10 marks]

b) An experienced OR scientist solve the same problem using Excel solver and generated
sensitivity report as follows. Describe the meaning of shadow price and reduced cost
corresponds to
Reduced Objective Allowable Allowable
Cell Name Cost Coefficient Increase Decrease

Bang-Lond 0 10 0 1E+30
Bang-Glasg 3 5 1E+30 3
Question continues…

Page 2 of 4
 Bang-Cardif 5 12 1E+30 5
Bang-Dunde 0 8 1E+30 0
Viet-Lond 0 12 0 0
Viet-Galsg 0 4 3 1E+30
Viet-Cardif 3 12 1E+30 3
Viet-Dunde 0 10 0 0
Sri Lan-Lond 0 8 1E+30 0
Sri Lan-Glasg 10 10 1E+30 10
Sri Lan-Cardiff 0 5 3 1E+30
Sri-Dunde 0 6 0 3

Shadow Constraint Allowable Allowable

Cell Name Price R.H. Side Increase Decrease
London 12 50 0 10
Glasgow 4 25 0 25
Cardiff 9 35 0 15
Dundee 10 40 0 15
Bangladesh -2 40 10 0
Vietnam 0 50 0 1E+30
Sri Lanka -4 60 15 0

[10 marks]

Question 03

a) Apply Ford-Fulkerson Algorithm to find the maximal flow of the network flow diagram in
Figure Q3a. The values on edges represent the flow capacities. [10 marks]

Figure Q3a

b) Describe how you can capture the following cases when solving problems using the simplex
algorithm. [10 marks]

i) A problem containing multiple optimal solutions

ii) A problem containing unbounded solutions

Page 3 of 4
Question 04

a) Solve the following minimum spanning tree problem to the optimum. You are expected to
show the optimised network diagram in your answer. [10 marks]

Source Destination Weight

a b 4
b c 8
c d 7
d e 9
e f 10
a h 8
h g 1
g f 2
i g 6
b h 11
d f 14

b) Briefly describe a case to demonstrate practical implementation of minimum spanning tree

problem. You are expected to describe key elements of the practical example and how they are
related with the minimum spanning tree problem characteristics. [10 marks]

Question 05

a) Find the dual of following optimisation problem [05 marks]

b) Solve the following maximisation problem using any computer aided or manual method
you are familiar with. Based on your answer for the given primal problem, describe how
would you find the optimal solutions of the corresponding dual without solving the dual
problem.

[15 marks]

--End of paper--

Page 4 of 4