Description

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 (M2) and 2 hours on machine (M3). 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 M2 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? 

Formulate the problem as LPM

Solve the LPM using simplex algorithm.

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   

Machine Type  Productivity in Machine-hours per Unit)   Product 1 Product 2 Product 3  Milling Machine  8 2 3  Lathe  4 3 0  Grinder 2 - 1  

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.

Formulate the problem as LPM

Solve the LPM using simplex algorithm.

Determine the range of feasibility, optimality and insignificance

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.

Source Destinations  Supply    D1 D2 D3 D4   S1 1 2 1 4 30  S2 3 3 2 1 50  S3 4 2 5 9 20  Demand 20 40 30 10   

Determine an initial basic feasible solution to the following transportation problem by using (a) NWCM, Based the NWCM solution, carryout a stepping stone method of post optimality analysis to arrive at the optimum solution.

Source D1 D2 D3 D4 Supply  A 11 13 17 14 250   B 16 18 14 10 300   C 21 24 13 10 400   Demand 200 225 275 200   

Using the following cost matrix, determine 

 (a) Optimal job assignment, and

  (b) The cost of assignments. 

Machinist Job   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  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: 

Get assignment help from experts for better grades. Affordable & timely delivery. Guaranteed original work. 24/7 customer support. Order now!

Business Assignment Help

Instruction Files