Linear Programming: Graphical Method: F. M. Kapepiso
Linear Programming: Graphical Method: F. M. Kapepiso
Graphical Method
F. M. Kapepiso
Learning objectives
On December 1, 2007, available raw material is 400 units. Each tape recorder
requires 3 units of raw material while radio requires 2 units. Labour requirement
for both products is 3 hour per unit and maximum hours available are 510.
Required:
1. Formulate LP problem stating objective function and constraints clearly.
2. Solve above LPP using graphic method.
Adapted: Test 1 of 2016
2.1. A company manufactures two products (X and Y) in one of its factories. The
manufacturer wants to determine the production mix which will maximize profit. The
profit on product X is $25 and $50 on product Y. A maximum that can be sold for
product X is 50 and product Y 40. Production takes place in two departments. The
finishing department has a capacity of 300 hours while the assembly department has
a capacity of 480 hours.
The manufacturing times are as follows:
Finishing Assembly
Required:
The average marginal contributions per transport trip are $200 for private customer and $150
per commercial customer.
Required:
3.1. Formulate the linear programming model. (6 marks)
3.3. Determine how many private customer trips and how many commercial customer
trips should be undertaken to maximize profits, using the corner-point methods. (12
marks)
Adapted: Normal June 2013 examination
A company manufactures two products (X and Y) in one of its factories. Production capacity
is limited to 80 000 machine hours per period. The available direct labour hours are 50000
per period.
Product X Product Y
Fixed costs are absorbed into unit costs based upon full capacity and amounts to N$4000 per
unit of X and N$7000 per unit of Y respectively.
Required: