BSc Mathematics and Computer Science and Physical Sciences.

Year 3.1
Operation Research Assignment | (35 Marks)

1. In Glepetto’s wooden soldiers and trains store, each soldier sells for $27, uses $10 of raw
materials and takes $14 of labor and overhead costs. Each train sells for $21, uses $9 of
raw materials, and takes $10 of overhead costs. Each soldier needs 2 hours finishing and 1
hour carpentry; each train needs 1 hour finishing and 1 hour carpentry. Raw materials are
unlimited, but only 100 hours of finishing and 80 hours of carpentry are available each
week. Demand for trains is unlimited; but at most 40 soldiers can be sold each week.
Formulate a linear programming problem to be used to find how many of each toy should
be made each week to maximize profits
(4 Marks)

2. Write an R code to solve the linear programming problem described in (1) (6 Marks)

3. Find the optimal solution to the LPP below using simplex method.
Maximize z = 60x1 + 30x2 + 20x3
Subject to;

8x1 + 6x2 + x3 ≤ 48
4x1 + 2x2 + 1.5x3 ≤ 20
2x1 + 1.5x2 + 0.5x3 ≤ 8
x2 ≤ 5
and x1 , x2 , x3 ≥ 0

(10 Marks)

4. A company has three supply points S1 , S2 and S3 and three market destinations D1 , D2 and D3 .
The capacities of supply points Ai and the demands of the destinations B j are given in the
table below. The cost Ci j associated with transporting one unit of the resource from a
supply point to a destination is given below

D1 D2 D3 Ai
S1 1 2 2 200
S2 3 5 5 350
S3 1 1 3 500
Bj 300 600 400

(i) Obtain the initial allocation using Vogel Approximation method (4Marks)
(ii) Obtain the initial allocation using northwest corner rule, and solve this problem
determine the optimal allocation that minimizes the cost of distribution (7 Marks)
(iii) Write R code to solve the transportation problem (4 Marks)

0 BSc MCS and PS Assignment

1
 ALL THE BEST COMRADES
NB: Assignment to be submitted on Friday 9/7/2022, 4 pm ""Submission of assignment
after 4 pm will attract Zero mark i.e (1) I will not accept any assignment after 4 pm you will
mark for yourself (2) I will not accept any explanation for not doing assignment or failure to
submit (Explanations will be yours)""