Scribd
Upload
5 views

LPP Formation

The document contains 5 examples of linear programming problems involving resource allocation and profit maximization. Each example provides the necessary constraints and objective functions to formulate the linear programming problem.

Uploaded by

vaishnavipatel.it22
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views

LPP Formation

The document contains 5 examples of linear programming problems involving resource allocation and profit maximization. Each example provides the necessary constraints and objective functions to formulate the linear programming problem.

Uploaded by

vaishnavipatel.it22
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

1.

A machine tool company conducts a job-training programme at a ratio of one for every

twenty trainees. The training programme lasts for two months. From past experience it

has been found that out of 20 trainees hired, only 10 complete the programme

successfully. (The unsuccessful trainees are released). Trained machinists are also needed

for machining. The company's requirement for the next three months is as follows:

January: 200 machinists, February: 350 machinists and March: 150 machinists.

In addition, the company requires 450 trained machinists by April. There are 330 trained

machinists available at the beginning of the year. Pay roll cost per month is:

Each trainee Rs. 550/- per month.

Each trained machinist (machining or teaching): Rs. 650/- p.m.

Each trained machinist who is idle: Rs. 550/- p.m. (Labour union forbids ousting trained

machinists). Build a L.P.P. for produce the minimum cost hiring and training schedule

and meet the company’s requirement.

2. A company manufactures two products, X and Y by using three machines A, B, and C.

Machine A has 4 hours of capacity available during the coming week. Similarly, the

available capacity of machines B and C during the coming week is 24 hours and 35 hours

respectively. One unit of Linear Programming Models (Resource Allocation Models) 29

product X requires one hour of Machine A, 3 hours of machine B and 10 hours of

machine C. Similarly one unit of product Y requires 1 hour, 8 hour and 7 hours of

machine A, B and C respectively. When one unit of X is sold in the market, it yields a

profit of Rs. 5/- per product and that of Y is Rs. 7/- per unit. Formulate the LPP.

3. A company manufactures two products X and Y. The profit contribution of X and Y are

Rs.3/- and Rs. 4/- respectively. The products X and Y require the services of four

facilities. The capacities of the four facilities A, B, C, and D are limited and the available

capacities in hours are 200 Hrs, 150 Hrs, and 100 Hrs. and 80 hours respectively. Product
X requires 5, 3, 5 and 8 hours of facilities A, B, C and D respectively. Similarly the

requirement of product Y is 4, 5, 5, and 4 hours respectively on A, B, C and D. Find the

optimal product mix to maximise the profit. Formulate the LPP.

4. An aviation fuel manufacturer sells two types of fuel A and B. Type A fuel is 25 % grade

1 gasoline, 25 % of grade 2 gasoline and 50 % of grade 3 gasoline. Type B fuel is 50 % of

grade 2 gasoline and 50 % of grade 3 gasoline. Available for production are 500 liters per

hour grade 1 and 200 liters per hour of grade 2 and grade 3 each. Costs are 60 paise per

liter for grade 1, 120 paise for grade 2 and100 paise for grade 3. Type A can be sold at

Rs. 7.50 per liter and B can be sold at Rs. 9.00 per liter. Formulate the LPP.

5. A company manufactures two products X1 and X2 on three machines A, B, and C. X1

require 1 hour on machine A and 1 hour on machine B and yields a revenue of Rs. 3/-.

Product X2 requires 2 hours on machine A and 1 hour on machine B and 1 hour on

machine C and yields revenue of Rs. 5/-. In the coming planning period the available time

of three machines A, B, and C are 2000 hours, 1500 hours and 600 hours respectively.

Formulate the LPP.

You might also like