Get premium membership and access revision papers, questions with answers as well as video lessons.

Operation Research Ii Question Paper

Operation Research Ii 

Course:Bachelor Of Commerce

Institution: Kca University question papers

Exam Year:2010



UNIVERSITY EXAMINATIONS: 2009/2010
FIRST YEAR EXAMINATION FOR THE DEGREE OF BACHELOR OF
COMMERCE
CMS 300: OPERATION RESEARCH II(Sunday)
DATE: AUGUST 2010 TIME: 2 HOURS
INSTRUCTIONS: Answer question ONE and any other TWO questions
QUESTION ONE
(a) In analysing switching by Business Class customers between airlines the following data has been
obtained by Kenya Airways (KQ).
Next flight by
KQ Competition
Last flight by KQ 0.85 0.15
Competition 0.10 0.90
(i) Interpret the probabilities [2 Marks]
(ii) Assume that Business Class customers make 2 flights a year on average. And that
currently KQ have 30% of the Business Class market. What would you forecast KQ’s''s
share of the Business Class market to be after two years? [8 marks]
(b) Explain the 3 alternative categories of mathematical models [6 Marks]
(c) With the help of an illustration describe dynamic programming [6 Marks]
(d) Use the following network below to generate an LP input model for
LINGO [8 Marks]
2
3
4
2
2
3 2
3
1
4
3
6
5
2
QUESTION TWO
(a) Explain the transactions table of the Input output model [6 Marks]
(b) Operations research decision making process is anchored on two decision making models.
Exhaustively explain these models. [14 Marks]
QUESTION THREE
Nairobi city council for the last one year has been investing in lighting up Mombasa road. Its logistics
office has been monitoring this exercise closely and has documented failure rate of the 1000 highway
bulbs installed last year as summarized below:
End of month: 1 2 3 4 5 6
Probability of failure: 0.05 0.20 0.40 0.65 0.85 1.00
The cost of replacing all bulbs at once is 25 per bulb. When should the Municipality replace all the
bulbs and how much would it cost the Municipality? [20 Marks]
QUESTION FOUR
The distance in kilometers between 10 construction sites are shown in the table below. Use minimum
spanning tree algorithm 2 to determine the connections between the sites that will minimize the total
length of roads to be built. Show the connections and give the total length. Arbitrarily start from node
6. [20 Marks]
3
SITE 1 2 3 4 5 6 7 8 9 10
1 - 30 45 - - - - - - -
2 30 - - - 25 - 35 50 - -
3 45 - - 50 - 20 - - 60 -
4 - - 50 - - 45 - - - -
5 - 25 - - - 40 15 - - -
6 - - 20 45 40 - - - 30 35
7 - 35 - - 15 - - 30 - 20
8 - 50 - - - - 30 - - 25
9 - - 60 - - 30 - - - 40
10 - - - - - 35 20 25 40 -
QUESTION FIVE
(a) List and explain different types of maintenance. [4 Marks]
(b) Use an illustration to define economic life of an equipment [6 Marks]
(c) With the help of an example explain the two types of replacement problem [4 Marks]
(d) You have been given a formulated model to input in LINGO. Enumerate eight keying guidelines
for LINGO. [6 Marks]






More Question Papers


Popular Exams



Return to Question Papers