UNIVERSITY OF MINES AND TECHNOLOGY, TARKWA

FIRST SEMESTER EXAMINATION, APRIL 2024

COURSE NO: GM/GL/ES/MC/EL/CE 459

COURSE NAME: OPERATIONS RESEARCH
CLASS: GM/GL/ES/MC/EL/CE IV TIME: 3 Hours

LNUGS-UMAT SRID
Name: __________________________________________ Index Number: _______________

ALL ANSWERS SHOULD BE ON THIS QUESTION PAPER

SECTION A (10 marks) – Answer ALL the Questions in this section on the Question Sheet by
circling the best option(s)

1. The critical path satisfies the condition that

a. Ei = Li and Ej = Lj c. Lj – Ei = Li – Ej = d (constant)
b. Lj – Ei = Li – Lj d. All of the above
2. The activity that can be delayed without affecting the execution of the immediate succeeding
activity is determined by
a. total float c. free float
b. independent float d. none of the above
3. An optimization model
a. provides the best decision c. helps in evaluating various
alternatives
b. provides decision within its
limited context d. all of the above
4. While solving a LP model graphically, the area bounded by the constraints is called
a. feasible region c. infeasible region
b. infeasible region d. none of the above
5. For a maximization problem, the objective function coefficient for an artificial variable is
a. + M c. Zero
b. – M d. none of the above
6. The dual of the primal maximization LP problem having m constraints and n non-negative
variables should
a. have n constraints and m non- b. be a minimization LP problem
negative variables

Page 1 of 9
 c. both (a) and (b) d. none of the above
7. Branch and Bound method divides the feasible solution space into smaller parts by
a. branching c. enumerating
b. bounding d. all of the above
8. The solution to a transportation problem with m-rows (supplies) and n-columns (destination)
is feasible if number of positive allocations are
a. m + n c. m + n – 1
b. m × n d. m + n + 1
9. A dummy activity is used in the network diagram when
a. two parallel activities have the c. both (a) and (b)
same tail and head events d. the chain of activities may have a
b. the chain of activities may have a common event yet be independent
common event yet be independent by themselves
by themselves
10. The cost of providing service in a queuing system decreases with
a. decreased average waiting time in c. increased arrival rate
the queue d. none of the above
b. decreased arrival rate

SECTION B (10 marks) – Answer ALL the Questions in this section on the Question Sheet
by indicating whether the following statements are True or False

1. The CPM is used for completing the projects that involves activities of repetitive nature.
a. True b. False
2. A network in which the activities are represented by an arrow is referred to as activity-on-
node network.
a. True b. False
3. Linear programming is a technique for finding the best uses of an organization’s
resources such as manpower, money and machinery.
a. True b. False
4. An optimal solution does not necessarily use up all the limited resources available.
a. True b. False
5. If the objective function coefficient in the Cj row above an artificial variable is – M, then
the problem is a minimization problem.
a. True b. False
6. A variable which is in the solution of a linear programming problem is called basic variable.

Page 2 of 9

LNUGS-UMAT SRID
 a. True b. False
7. The transpose of the primal constraints’ coefficients become the dual constraint
coefficients.
a. True b. False
8. Along a branch and bound minimization tree, the lower bound do not increase objective
function value.
a. True b. False
9. In assignment problem, the minimum number of lines required to cover all zeroes
cannot be more than the number of columns/rows in the problem.
a. True b. False
10. As arrival rate at any queuing system increases, the cost of providing service decreases.
a. True b. False

SECTION C (10 marks) – Answer ALL the Questions in this section on the Question Sheet
by Completing the blank(s) with the appropriate word or phrase.

1. Expected duration /Time

The amount of time that is expected to complete the activity is called ______________
2. _________________ of the decision variables is one of the assumptions of the linear
programming model. proportionality, additivity, divisibility and certainty.
Infeasibility
3. ______________ occurs when no value of the variable is able to satisfy all the constraints in
linear programming problem simultaneously.
surplus variable represents amounts by which solution values exceed a resource
4. A —————
co-efficient of decision constraint
5. The —————— variables in the primal correspond to the dual —————— variables in
the optimal solution.
Integer
6. ____________ programming is an extension of the linear programming in which feasible
solution must have integer values.
assignment problem
7. The ________________________is a special type of transportation problem with an equal
number of sources and destinations and each source’s supply and destination’s demand
equalling one.
slack
8. A ____________ variable represents an unused resource in LP problem
9. when a non-basic variable has a net cost change C*ij (Cj-Zj) of zero in the final transportation
degeneracy
tableau, ________________________ is implied
Balking/Jockeying
10. ____________ customers move from one queue to another hoping to receive service more
quickly.

Page 3 of 9

LNUGS-UMAT SRID
 ANSWERS THREE (3) QUESTIONS IN THIS SECTION

SECTION D – Solve the following questions in the provided Answer Booklet

Answer all Questions on this Question sheet.
Question 1
An engineering student owns 45 acres of land. She wants to build a mechanical shop or house for
rent. Each acre used for the shop yields $ 200 profit; each with house yields $ 300 profit. The
labour and material used for each acre are given in Table 1. There are 100 workers, and 120 pieces
of materials are available. Model the problem as a LP to determine how the student can maximize
profits from her land.
Table 1
Shop (X1) House (X2)
Labour 3 workers 2 workers
Material 2 tonnes 4 tonnes

Answer the following questions if the decision variables for the above questions are as follows:
X1 = Shop built
X2 = House built

1a) What is the objective function of the LP?

Max Z= 200X1 + 300x2
…………………………………. [3 marks]

1b) Write the constraint corresponding to the LAND?

X1 + X2 <= 45
…………………………. [3 marks]

1c) Write the constraint corresponding to the LABOUR constraint?

3X1 + 2X2 <= 100
…………………………………………….. [2 marks]

1d) Using the graphical method of solution (NOT DRAWN TO SCALE), solve the problem
simultaneously and advice the engineering student on the optimal decision to make.
X1=10 X2=35
…………………………………………….. [7 marks]

Page 4 of 9

LNUGS-UMAT SRID
Question 2
A chemical Manufacturing Company (JoCHEM) produces H2SO4 stock solutions of different
purity, 95% and 85% purity, in 100mL amber bottles. Both acids were required for laboratory use
during acid digestion for metal analysis using the ASS. The respective profit for one 100mL bottle
is $5 and $4 per stock solution. The 95% stock solution production requires twice as much time as
the 85% stock solution. If all the stock solutions are of 85% purity, the company could produce 15
stock solutions per day. The supply of chemicals for production is sufficient for only 12 stock
solutions daily (both 95% and 85%). Per the national standard (Ghana), 95% purity stock solution
requires a special cork manufactured by the ES department of UMaT, and only six (6) can be
supplied to JoCHEM daily.
The Linear programming model for the problem is summarised below.
X1 = quantity of 95% purity stock solution produced daily and
X2 = quantity of 85% purity stock solution produced daily.
Max Z = 5X1 + 4X2 Profit ($)
Such that:
2X1 + X2  15 (Stock solution production daily)
X1 + X2  12 (Chemical Supply for production)
X1  6 (Cork supply)
X1, X2  0 (Non negativity)

Solve the above linear programming model using the simplex method and answer the following
questions:

2a) Write the three (3) decision variables in the basic solution of the final Tableau?
X1 , X2, S3
………………………………… [6 marks]

2b) What is the optimal value of the problem?

Max Z = 51
………………………………………………. [2 marks]

2c) What are the values of the decision variables of the optimal solution found?
X1=3 , X2= 9 and S3= 3
………………………………………………. [3 marks]

Page 5 of 9
2d) What is the range of the profit contribution of stock solutions 95% purity in the objective
function such that the optimal solution obtained in (i) remains unchanged?

………………………………………………….. [4 marks]

Question 3
a) Four students, Nyamekye, Nhyira, Aseda, and Blessing, want to earn some money to cover
personal expenses during a school trip to Kakum National Park. The students are presented
with three chores to do to earn some money: mowing lawn (ML), painting garage door
(PGD), and washing family cars (WFC) by their manager. To avoid anticipated
competition, the students were asked to submit (secret) bids for what they feel is fair pay
for each of the three chores. The understanding is that all three students are eligible to get
their preferred chore. Table 1 summarises the bids received.
Table 1
CHORES
STUDENTS
ML PGD WFC

Nyamekye $1 $4 $6
Nhyira 9 7 10
Aseda 4 5 11
Blessing 8 7 8

Solve the following problem and answer the following questions:

3a) Based on this information, how should the assignment of the chores be made for the students
to maximize gains?
…………………………………………………………………… [5 marks]

3b) Determine the total cost involved in the optimal assignment.

…………………………………………………………….. [2 marks]

Page 6 of 9

LNUGS-UMAT SRID
b) Heavy duty cargo trucks arrive at an axle load weighing station in a manner described by a
discrete random variable x (Table 2). The truck drivers drive through the weighing area and will
move straight to be weighed if the weighing machine is idle. If the weighing machine is busy
the truck will join the queue until the machine becomes idle. The queue discipline is first in first
out (FIFO). The machine takes 5 seconds to weigh each truck. Assume that the first truck will
arrive at the station at time zero (0).
Table 2

Time between Arrivals Frequency of

(Seconds)
Occurrence
(y)
2 10
3 60
4 45
5 10

Table 3
Time Start Weighing Time to Time at
between weighing time Depart Weighing
ith Random Arrival Wait Queue
arrivals station station
number clock time time length at (s)
Truck (s)
(s) entry (s) (s)
(s)
x

3c) What random process generator for time between arrivals correspond to a 4 second time
between arrival?

……………………………………………… [1 mark]

Page 7 of 9
3d) With a seed value of 29, a constant multiplier of 17 and modulo of 83, use the Multiplicative
Congruential technique to generate 8 random numbers. Which random number corresponds to
number 4 (r4).
……………………………………….. [2 marks]

Simulate the next 8 arrivals based on the random numbers and process generator. You may use the
Table 3 above with the headings provided as a guide and answer questions 3e to 3g.

3e) What is the wait time for the 5th Truck?

……………………………………….. [1 mark]

3f) What is the arrival Clock for the 3rd Truck?

……………………………………………………. [2 marks]

3g) What is the average wait time in the system?

…………………………………………….. [2 marks]

Question 4
An equipment installation project involves eight (8) activities. The activity times and the
precedence relationships are shown in Table 4.

Table 4 Activity schedule

Normal Crush
Activity
Activity Duration Cost Duration Cost
Predecessor
(Days) (GH ₡) (Days) (GH₡)
A - 6 300 5 400
B - 8 400 6 600
C B 7 400 5 600
D B 12 1000 4 1400
E B 8 800 8 800
F E 7 400 6 500
G A, D, C 5 1000 3 1400
H F, G 8 500 5 700

Page 8 of 9

LNUGS-UMAT SRID
Using Question 5, construct a CPM network representing the installation project and answer the
following questions:

4a) How many dummy(ies) does the CPM network has(have)?

……………………….. [2 marks]

4b) What is the minimum duration (longest time) in completing the project?

……………………………………… [3 marks]

4c) What is the critical path for the activities?

………………………………………. [5 marks]

4d) Which of the following is not a Free Slack (FS) in the system?

[2 marks]
a) 14 c) 0
b) 5 d) 1

4e) If the project is to be completed in 28 days with minimum crash cost, which two activities
should be crashed?

…………………………………………. [3 marks]

SUBMIT YOUR QUESTION PAPER WITH YOUR ANSWER BOOKLET

Examiners
Dr B. O. Afum
Dr C. K. Arthur
Dr T. Joe-Asare

Page 9 of 9