CHRISTIAN SERVICE UNIVERSITY COLLEGE

KUMASI, GHANA

FACULTY OF HEALTH & APPLIED SCIENCE

DEPARTMENT OF COMPUTER SCIENCE AND INFORMATION
TECHNOLOGY

BACHELOR OF SCIENCE IN COMPUTER SCIENCE

MID-SEMESTER EXAMINATION, NOVEMBER 2020

CSCP 265: OPERATIONS RESEARCH

SUBMISSION DEADLINE: 8PM TODAY(7/11/2020)

GENERAL INSTRUCTION TO CANDIDATES

 Answer ALL of the following questions.

 Marks will be awarded for clarity of expression and presentation.

 Write your index number boldly on all sheets used.

 Programmable and Graphing calculators are not allowed.

 You will be PENALIZE for any exam malpractices detected.

Index Number: Signature: - Page 2 of 2 Alg & Trig

1. (a) Describe how operation research technique may be required in the following
(i) Assigning audit teams effectively
(ii) Credit policy analysis
(iii) Investment analysis
(iv) Portfolio analysis
(v) Deciding most effective packaging alternative
(b) A bed mart company is in the business of manufacturing beds and pillows. The
company has 40 hours for assembly and 32 hours for finishing work per day.
Manufacturing of a bed requires 4 hours for assembly and 2 hours in finishing.
Similarly a pillow requires 2 hours for assembly and 4 hours for finishing. Prof-
itability analysis indicates that every bed would contribute Ghc.80, while a pillow
contribution is Ghc.55 respectively. Find out the daily production of the company
to maximize the contribution (profit) using graphical analysis.

2. A factory produces three using three types of ingredients viz. A, B and C in different
proportions. The following table shows the requirements o various ingredients as inputs
per kg of the products.

Product/Ingredients A B C
1 4 8 8
2 4 6 4
3 8 4 0

The three profits coefficients are 20, 20 and 30 respectively. The factory has 800 kg
of ingredients A, 1800 kg of ingredients B and 500 kg of ingredient C. Determine the
product mix which will maximize the profit and also find out maximum profit using
the simplex method.

3. Solve the following linear programming problem using the two phase method.

Maximise 12x1 + 15x2 + 9x3

subject to:

8x1 + 16x2 + 12x3 ≤ 250

4x1 + 8x2 + 9x3 ≥ 70
5x1 + x2 + 8x3 = 110
x1 ≥, x2 ≥ 0

Examiner: Dr. Adu Sakyi