[go: up one dir, main page]
Scribd
Upload
22 views1 page

LPP Formulation

The document outlines various linear programming problems related to production optimization for different manufacturers. It includes scenarios for maximizing profits based on machine time constraints and material costs. Each problem requires formulating a linear programming model to determine optimal production levels or material usage.

Uploaded by

vasavimuskari
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
22 views1 page

LPP Formulation

The document outlines various linear programming problems related to production optimization for different manufacturers. It includes scenarios for maximizing profits based on machine time constraints and material costs. Each problem requires formulating a linear programming model to determine optimal production levels or material usage.

Uploaded by

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

Linear Programming Problems - Formulation

1. A manufacturer of furniture makes chairs and tables. They are produced on two machines
A & B. A chair requires of 2 hours on machine A and 6 hours on machine B. A table
requires 5 hours on machine A and no time on machine B. There are 15 hours of time per
day available on machine A and 30 hours on machine B. The profit per chair is Rs.1 and per
table is Rs. 5. What would be daily production of chairs and tables to get maximum profit?

2. Two spare parts X & Y are to be produced in a batch. Each has to go through two processes
A & B. The tie required in hours per unit and total time available is given below. Profits per
unit of X & Y are Rs.5 and Rs. 6 respectively. Find how many numbers of spare parts are to
be produced to maximize the profit?

X Y Total hours available


Process A 3 4 24
Process B 9 4 35

3. The ABC Company combines materials X & Y to form a product which must weigh 50 kgs.
At least 20 kgs of X and no more than 40 kgs of Y can be used. The cost of X is Rs. 10 per kg
and that of Y is Rs. 25 per kg. Use graphical method to find the amounts of material X & Y
which should be used to minimize the total cost.

4. A manufacturer has three machines A, B and C with which he produces three different
articles P, Q and R. The different machine times required per article, the amount of time
available and profit per article are as follows. Formulate it as LPP.

Article Machine Time Profit per article


A B C
P 8 4 2 20
Q 2 3 0 6
R 3 0 1 8
Available machine hours 250 150 50

5. A firm manufactures three types of products A,B and C. The profits are Rs.3, Rs.2 and Rs.4
respectively for A,B and C. The firm has two machines M and N and below is the
processing time required in minutes for each product. Machines M & N are available for
2000 minutes and 2500 minutes respectively. The firm must manufacture 100 A’s, 200 B’s
and 50 C’s, but not more than 150 A’s. Formulate it as LPP.

Machine Product
A B C
M 4 3 5
N 3 2 4

You might also like