Assignment (40%) : A) Formulate The Problem As LPM B) Solve The LPM Using Simplex Algorithm
Assignment (40%) : A) Formulate The Problem As LPM B) Solve The LPM Using Simplex Algorithm
1. JOY leather, a manufacturer of leather Products, makes three types of belts A, B and C
which is processed on three machines M1, M2 and M3. Belt A requires 2 hours on machine
(M1) and 3 hours on machine (M 2) and 2 hours on machine (M 3). Belt B requires 3 hours
on machine (M1), 2 hours on machine (M2) and 2 hour on machine (M3) and Belt C requires
5 hours on machine (M2) and 4 hours on machine (M3). There are 8 hours of time per day
available on machine M1, 10 hours of time per day available on machine M 2 and 15 hours
of time per day available on machine M3. The profit gained from belt A is birr 3.00 per
unit, from Belt B is birr 5.00 per unit, from belt C is birr 4.00 per unit. What should be the
daily production of each type of belt so that the profit is maximum?
a) Formulate the problem as LPM
b) Solve the LPM using simplex algorithm.
2. A manufacturing firm has discontinued production of a certain unprofitable product line.
This has created considerable excess production capacity. Management is considering
devoting this excess capacity to one or more of three products: product 1, 2 and 3. The
available capacity on the machines which might limit output is summarized in the
following table:
Machine Type Available Time
(in Machine- hours per Week)
Milling Machine 250
Lather 150
Grinder 50
The number of machine-hour required for each unit of the respective product is as follows
The profit per unit would be Birr 20, Birr 6, and Birr 8 respectively for product 1, 2 and 3. Find
how much of each product the firm should produce in order to maximize profit.
a) Formulate the problem as LPM
b) Solve the LPM using simplex algorithm.
1|Page
3. Determine an initial basic feasible solution to the following transportation problem by
using (a) the least cost method, and (b) Vogel’s approximation method. Based the initial
basic feasible solution that is relatively small conduct a modified distribution method to
determine the optimum solution to the problem.
Job
Machinist 1 2 3 4 5
A 10 3 3 2 8
B 9 7 8 2 7
C 7 5 6 2 4
D 3 5 8 2 4
E 9 10 9 6 10
6. A solicitor’s firm employs typists on hourly piece-rate basis for their daily work. There
are five typists and their charges and speed are different. According to an earlier
understanding, only one job is given to one typist and the typist is paid for a full hour even
when s/he works for a fraction of an hour. Find the least cost allocation for the following
data:
2|Page
E 4 11 T 178
Assume that the typist is to be paid @ birr 5 per hour, the elements of the cost matrix are
7
obtained as follows. To illustrate, if typist A is given job P, he would require 199/12 =16
12
hours and, hence, be paid for 17 hours. This results in a cost of Birr 85(17 X 5) for this
combination.
7. A farmer is attempting to decide which of three crops he should plant on his 100 acre
farm. The profit from each crop is strongly dependent on the rainfall during the growing
season. He has categorized the amount of the rainfall as substantial, moderate or light. He
estimates his profit for each crop as shown in the table below:
(a) From the available data, determine the optimal decision as to which crop to plant under
condition of uncertainty
(b) From the available data, determine the optimal decision as to which crop to plant under
condition of risk EMV and EOL
3|Page
Job
Machinist 1 2 3 4 5
A 10 3 3 2 8
B 9 7 8 2 7
C 7 5 6 2 4
D 3 5 8 2 4
E 9 10 9 6 10
10. The owner of shop is contemplating to add a new product, which will require additional
monthly payment of $ 20,000. Variable costs would be $ 5.00 per new product, and its
selling price is planned to be $ 8.00 each.
a. How many new products must be sold in order to break-even?
b. What would the profit (loss) be if 2,000 units were sold in a month?
c. How many units must be sold to realize a profit of $ 5,000?
11. Make a decision for the type of investment to be selected on the basis of the following
data using the Savage criterion (Minimax Regret Rule).
4|Page
Good economic Medium condition Poor economic
condition condition
5|Page