0% found this document useful (0 votes)
78 views30 pages

LPP Problems

Uploaded by

julietgasper06
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
0% found this document useful (0 votes)
78 views30 pages

LPP Problems

Uploaded by

julietgasper06
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/ 30

LPP PROBLEMS

Product Mix

The standard weight of a special brick is 5kg and it contains two


ingredients B1 and B2, B1 costs Rs. 5 per kg and B2 costs Rs. 8 per kg.
Strength considerations dictate that the brick contains not more than
4 kg of B1 and a minimum of 2 kg of B2 since the demand for the
product is likely to be related to the price of the brick.
Formulate the above problem as L.P. Model.
X:The quantity of B1 should be used.
Y: The quantity of B2 should be used.

Min z= 5X+8Y

S.to.c
X≤4
Y≥2
X+Y=5
X,Y ≥0
A firm produces two types of cloth, printed and plain. Three
kinds of yarns are required to produce the Cloth – Red, green, and blue.
One unit length of printed cloth needs 2 meters of red yarn, 6 meters of
blue yarn and 4 meters of green yarn. One unit length of plain cloth
needs 5 meters of red yarn. The firm has a stock of 8 meters of Red
yarn, 10 meters of green yarn and 15 meters of blue yarn. It is assumed
that the income obtained from one length of printed cloth is Rs. 10.00
and one length of plain cloth is Rs. 6.00.
Formulate the LPP so as to maximize the income obtained from the
sale of the finished cloth.
RED GREEN BLUE PROFIT

printed 2 4 6 10

Plain 5 - - 6

STOCK 8 10 15
X: No.of units of printed cloth to be manufactured
Y: No. of Units of plain cloth to be manufactured.

Max Z= 10x+6y
s.to.c
2x+5y≤8
4x ≤10
6x ≤15
x,y≥0
An Animal food company must produce 200 kg of a mixture
consisting of ingredients x1 and x2 daily. X1 costs Rs. 3 per kg and x2
costs Rs. 8 per kg. No more than 80 kg of x1 can be used and at least 60
kg of x2 must be used.

Formulate a LP. Model to minimize the cost.


X:The quantity of X1 should be used.
Y: The quantity of X2 should be used.

Min z= 3X+8Y

S.to.c
X≤80
Y≥60
X+Y=200
X,Y ≥0
Anita Electric company produces two products P1 and P2 .
Products are produced and sold on a weekly basis. The weekly
production cannot exceed 25 for product P1 and 35 for product P2
because of limited available facilities. The company employs total
of 60 workers. Product P1 required 2 man-weeks of labour, while P2
requires one-man week of labour. Profit margin on P1 is Rs.60 and
on P2 is Rs.40 . Formulate this problem as an LP problem .
X:
Y:
Max z= 60x+40y

s.to.c
X<=25
Y<=35
2x+y<=60
X,y>=0
G.J . Breweries Ltd. Have two bottling plants one located at ‘G’ and the
other at ‘J’. Each plant products three drinks , whisky, beer and brandy
named A, B and C respectively. The number of the bottles produced per day
are shown in the table.
Plant at
Drink
G J
Whisky 1500 1500
Beer 3000 1000
Brandy 2000 5000
A market survey indicates that during the month of july , there will
be a demand of 20,000 bottles of whisky, 40,000 bottles of beer &
44,000 bottles of brandy. The operating cost per day for plants at G
and J are 600 and 400 monetary units. For how many days each plant
be run in july so as to minimize the production cost, while still meeting
the market demand?
• X: NO. of day’s of plant G should run
• Y: NO. of day’s of plant J should run

• Min z = 600X+400y

• 1500X+1500y>=20000 (whisky)
• 3000x+1000y>=40000 (beer)
• 2000x+5000y>=44,000 (brandy)
X,y>=0
A company sells 2 products A and B, it makes a profit of Rs.40
and Rs.30 respectively per unit of A and B. The product process has a
capacity of at most 30,000 man hours. It takes 3 hours to produce 1
unit of A and 1 hour to Produce an unit of B. The demand for the
products A and B cannot exceed 8,000 and 12,000 respectively .
Formulate the L.P.P.
X:
Y:
Max z = 40x+30y
s.to.c
X<=8000
Y<=12000
3x+y<=30000
X,y>=0
An oil company has 2 units A and B which produce 3
different grades of oil; Superfine , Medium and low grade. The
company has to supply 12, 8 and 24 barrels of Superfine, Medium and
low grade oils respectively per week. It costs the company Rs.10,000
and 8,000 per day to run the units A and B respectively. On a day unit
A produces 6,2,4 barrels and unit B produces 2,2,12 barrels of
superfine, medium and low grade oil respectively per day. The
manager of the company has to decide on how many days per week
should each unit be operated in order to meet the requirement at
minimum cost. Formulate L.P.P.
SUPER FINE MEDIUM LOW COST
A 6 2 4 10K
B 2 2 12 8K
DEMAND 12 8 24
X: No. of days of plant A should run
Y: No. of days of plant B should run
Min z= 10000x+8000y
s.to.c
6x+2y>=12
2x+2y>=8
4x+12y>=24
X,y>=0
A manufacturing company is engaged in producing three types of products: A, B
and C. The production department produces, each day, components sufficient to make
50 units of A, 25 Units of B and 30 Units of C. The management is confronted with the
problem of optimizing the daily production of the products in the assembly
department, where only 100 man-hours are available daily for assembling the
products. The following additional information is available.

The company has a


daily order commitment
Profit
Assemble time for 20 units of Product A
Type of contribution
Product per unit of
per product and a total of 15 units of
product (Rs)
( hrs) products B and C .
A 12 0.8
Formulate this
B 20 1.7 problem as an LP model
C 45 2.5 to maximize the total
profit.
X:No. of units of A to be manufactured
Y:
Z:

Max z= 12x+20y+45z
s.to.c
X<=50,y<=25,z<=30 (components)
0.8x+1.7y+2.5z<=100
X>=20,
Y+z>=15
X,y,z>=0
Production Allocation:
A manufacturer has 3 machines M,N and O which produce
articles A and B. The machine time required for articles, the amount
of time available on different machines and estimated profit per
article are given below.

Machine times (hrs)


Articles Profit/Article
M N O
A 4 2 2 100
B 3 1 4 60
Available
Machine 250 100 30
time

Formulate the L.P.P.


X= No. Of Units of Spare part ‘A’ to be manufactured.
Y= No. Of Units of Spare part ‘B’ to be manufactured.

Max Z= 100X+60Y

S. To . C
4X+3Y ≤ 250
2X+1Y ≤100
2X+4Y ≤30

X,Y≥0
Production Allocation problem:
A firm produces two spare parts A and B using Milling
machine and Grinding machine. The machine time required
for each spare part and the machine time available for each
machine are given in the following table . The profit on selling
each spare part is also given.

Time required per unit for Max. Time Formulate a linear


Machines Available. programming
Spare Part A Spare Part B
Milling problem such that
Machine 10 Min 5 Min 2500 Min the number of
Grinding
spare Part A and B
Machine 4 Min 10 Min 2000 Min
Profits per manufactured
spare part. Rs. 50 Rs. 100 maximizes the
profit.
X= No. Of Units of Spare part ‘A’ to be manufactured.
Y= No. Of Units of Spare part ‘B’ to be manufactured.

Max Z= 50X+100Y

S. To . C
10X+5Y ≤ 2500 ( Milling machine)
4X+10Y ≤2000 ( Grinding machine)
X,Y≥0
An electric company is engaged in the production of two components C1 and C2 that are used in
radio sets. Each unit of C1 costs the company Rs.5 in wages and Rs.5 in material, while each of C2 costs
the company Rs.25 in wages and Rs.15 in material. The company sells both products on one-period
credit terms, but the company’s labour and material expenses must be paid in cash. The selling price
of C1 is Rs.30 per unit and of C2 it is Rs. 70 per unit. Because of the company’s strong monopoly in these
components, it is assumed that the company can sell, at the prevailing prices, as many units as it
produces. The company’s production capacity is , however is limited by two considerations. First, at
the beginning of period 1 , the company has an initial balance of Rs. 4,000 ( Cash plus bank credit plus
collections from past credit sales). Second, the company has available in each period 2,000 hours of
machine time and 1,400 hours of assembly time. The production of each C1 requires 3 hours of
machine time and 2 hours of assembly time, whereas the production of each c2 requires 2 hours of
machine time and 3 hours of assembly time. Formulate this problem as an LP model so as to maximize
the total profit to the company.
A cooperative society of farmers has 50 hectare of land to grow two
crops X and Y. The profit from crops X and Y per hectare are estimated
as Rs 10,500 and Rs 9,000 respectively. To control weeds, a liquid
herbicide has to be used for crops X and Y at rates of 20 litres and 10
litres per hectare. Further, no more than 800 litres of herbicide should
be used in order to protect fish and wild life using a pond which collects
drainage from this land. How much land should be allocated to each
crop so as to maximise the total profit of the society?
X:hectare of land be allocated to crop X
Y:hectare of land be allocated to crop Y

Maximise Z = 10500 x + 9000 y


s.to.c
x + y ≤ 50 (constraint related to land)
20x + 10y ≤ 800 (constraint related to use of herbicide)
x,y>=0
(Diet problem) A dietician has to develop a special diet using two foods
P and Q. Each packet (containing 30 g) of food P contains 12 units of
calcium, 4 units of iron, 6 units of cholesterol and 6 units of vitamin A.
Each packet of the same quantity of food Q contains 3 units of calcium,
20 units of iron, 4 units of cholesterol and 3 units of vitamin A. The diet
requires atleast 240 units of calcium, atleast 460 units of iron and at
most 300 units of cholesterol. How many packets of each food should
be used to minimise the amount of vitamin A in the diet? What is the
minimum amount of vitamin A?
Let x and y be the number of packets of food P and Q respectively.
Minimize Z = 6x + 3y
subject to the constraints
12x + 3y ≥ 240 (constraint on calcium)
4x + 20y ≥ 460 (constraint on iron),
6x + 4y ≤ 300 (constraint on cholesterol)

x ≥ 0, y ≥ 0
Thank You.

You might also like