LINEAR PROGRAMMING

12)
PREVIOUS YEARS' QUESTIONS
2015

Long Answer Type Questions [6 Marks]

1. Find graphically, the maximum value of Z=2x + 5y, subject to constraints given
below:
2x + 4y s 8; 3x + ys6; x +ys4;x>0, y>0 [Delhil

Sol. Given inequations are

2x + 4y s8 or x + 2y <4
3x +ys6, x +ys4, x >0, y20,
To maximise Z = 2x + 5y
A
On plotting the graph of the inequations, we
notice shaded portion as feasible solution. 3

\CIo. 2
On substituting (0, 0) in inequations, We
8 6
get true statement. Therefore, we shade 1

the portion containing (0, 0). \A(2,

Possible points for maximum Z are A(2, 0), 1

B), C0, 2), O0, 0).

Point |Z=2x + 5y Value
A(2, 0) 4 + 0 4

B() 16
5
+ 30
5 40.5 9
C(0, 2) 0 + 10 10 - Maximum

O0,0) )+ 0 0
Zis maximum at C(0, 2), i.e. x = 0, y = 2, maximum value = 10.

Linear Programming 305

 2. Acompany manufactures three kinds of caleulators: 4, BandICin its two factories
manufacturing at least 6400
land 7. The company has
kind 4, 4000 of kind Band
got an
4800
order
of
for
kind C. The daily output of factory I calculators
of
is of
calculators of kind B, and 30 calculators off kind C. The
50 calculators of kind A, 50 of kind A, 20 of kind B and 40 of kind
of 40 caleulators
daily output of factory l/isfactory Il is
The cost per day to run / is R12,000 and of factory 15,000. How
wit
C. to be in operationto produce the order
many davs do the twofactories haveproblem as an LPP and solve it graphicall
the minimum cost? Formulate this
|Al India)
operates forx days and factory // operates for ydays.
Sol. Let factorvl Cost (in )
B C
4
50 30 12,000
Factor l() 50
20 40 15,000
Factorv Il () 40
> 4000 > 4800
6400

15000y
To minimise Z = 12000xt
Subject toconstraints: 200 D(0, 200)
x>0, >0
160
50x + 40y >6400 ’ 5x + 4 > 640 C(32,120)
’5x + 2y >400 120
50x + 20; > 4000
30x + 40y > 4800 ’ 3x + 4y > 480 80 B(80,
60)/
we notice
On plotting the graph of inequations,
40
A(160, 0)
solution.
shaded portion is the feasible 40 8Ò 120 160 200
Possible points for minimum Z are 3x +
’ 5x
+ 4y= 480
A(160, 0), B(80, 60), C(32, 120), D(0, 200) 5x
+ 4y
Point
A(160, 0)
Z= 12000 x + 15000 y
1920000 + 0
Value
1920000
2y =
40
=640
1860000
+ Minimum
960000 + 900000
B(80, 60)
384000 + 1800000 2184000
C(32, 120)
D(0, 200) 0 + 3000000 3000000

Zis minimumat B(80, 60), ie. x= 80,y= 60. 15000ys

I86000
draw the graph of inequations 12000 x t liesin
As region is open, we of feasible region
i.e. 4x + 5y s 620 (as dotted portion). We notice no point
dotted region. Therefore, minimun is at B(80, 60). days to meetthe
IIfor 60
Hence, factory I should operate for 80 days and factory
Iequrenents at aminimum costof? 18,60,000.

306 Chapterwise CBSE PYOs (Mathematics)-12

 MaximiseZ = &r + 9y subject to the constraints given below:
s.
6; Bx - 2y s 6; ys l; x, y>0 |horegn
+ 3y s
nequatons are
sl. Gven 6
- 2y s6: y s 1; x, y > 0 3 x =-62 y

= 8r + 9 5
Tomaximise Z
we notice
On plotting the inequations,
4

portion is the feasible solution. 2x +

shaded 3y
Possible points for
30
BÊ 13 13
maximum Zare A(2, 0).

c(1), D0, 1), o(0, 0).

=647
D(O, 1)
30

Z= &r + 9y Value 12'13

Point 4

16 + 0 16 A(2 0)
A(2. 0) -14
294 -Maximum
30 6 240 54 22.62
B 13 13 -2 +
13 13 13

12 + 9 21

D0, 1) 0 +9
0 + 0
O0, 0)
30 6 maximum value = 22.62.
,
30
i.e. 6
for x = 13 and y 13
Z is maximum at D13 13)

2014

Questions [6 Marks]
Long Answer Type
purchase a number of sewing machines. He has
wishes to storage. An electronic
t A dealer in rural area most 20 items for
and has space for at sewing machine 240. He
Only 5,760 to invest manually operated
360 anda manually operated
Sewing mnachine cost him machine at a profit of ? 22 and a
can sell an electronic sewing items that he
Assuming that he can sell all the
18. profit? Make it
sewing machine at a profit of money in order to maximise his
|Delhil
can buy, how should he invest his
as a LPP and solve it graphically. manually operated sewing
machines and y
Sol. Let he Purchases x electronic sewing
machines.
To maximise: Z= 22x + 18y
Linear Programmning 307
 Subject to constraints:
N 0 , y20
X+y S 20
S60x + 240y S 5760
3x + 2y s 48 20 Co, 20)

On plotting the inequations, we notice shaded

portion is the feasible solution. B(8, 12)
Possible points for maximum Zare A(16, 0), 10
B(8, 12), C(0, 20), O(0, 0)
Point Z= 22x + 18y Value
4(16. 0) 352 + 0 352 A(16. 0)
- Maximum 10 20
B(8, 12) 176 + 216 392

C(0, 20) 0+ 360 360 X+y=20

O(0, 0) 0+0
electronic machines and 19
Z is maximum at B(8, 12), i.e. x= 8, y= 12. Hence, 8
of
manually operated sewing machines must be purchased for a maximum profit
7392.
Aand B of Mathematics
5. A manufacturing company makes two types of teaching aids fabricating and 1labour
for class XII. Each type of A requires 9 labour hours of
fabricating and 3
hour for finishing. Each type of B requires 12 labour hours for
maximum labour hours
labour hours for finishing. For fabricating and finishing, the
80
available per week are 180 and 30 respectively. The company makes a profit of?
oneach piece of type A and 120 on each piece of type B. How many pieces profit? of type
maximum
A and type B should be manufactured per week to get a
week?
Make it as a LPP and solve graphically. What is the maximum profit per [AllIndia]

Sol. Let xpieces of type A and y pieces of type B are manufactured.

To maximise Z =80x + 120y
Subject to constraints: 30+
x >0, y >0; x + 3y < 30 25
9x + 12y < 180 ’ 3x + 4y < 60
204
On plotting the inequations, we notice
shaded portion is the feasible solution. 15+
T6C(0, 1Q)
Possible points for maximum Z are B(12, 6)
5
A(20, 0), B(12, 6), C(0, 10), O0, 0). A(20,0 X

5 10 15 2025 30 X+ 3y =30
3x + 4y = 60

308 Chapterwise CBSE PYQs(Mathematics)-12

 Point
Z= 80x+ 120y Value

20.0) i600+ 0 1600

960 + 720 1680 Maximum
B12.6)
0+ 1200 1200
C0.10)
0+0
O0. 0)
maximum at B(12, 6), i.e. x = 12, y = 6.

Hence, 12 pieces of type A, 6 pieces of type B must

be manufactured per week
of 1,680.
for a maximum profit
cottage industry manufactures pedestal lamps and wooden shades, each requiring
&. A
the use of a
grinding/cutting machine andla sprayer. It takes 2 hours on the grinding
lamp. It takes
cutting machine and 3 hours on the sprayer to manufacture apedestal
hours on the sprayer to manufacture a
1hour on the grindingcutting machine and 2
day, the sprayer is available for at the most 20 hours and the grinding/
shade. On any
profit from the sale of alamp is 25
utting machine for at the mnost 12 hours. The
the manufacturer can sell allthe lamps
and that from a shade is 15. Assuming that
he produces, how should he schedule his daily production in order
and shades that graphically. [Foreign]
Formulate a LPP and solve it
to maximise his profit. produced.
Let xpedestal lamps and y wooden shades are
sal
Grinding/cutting Sprayer Profit
machine

2hrs 3 hrs Z25 10 C(0, 10)

Pedestal lamps (*)
2 hrs 15
1hr
Wooden shades (y)
< 12 hrs s 20hrs

To maximise Z = 25x + 15y B(4, 4)

Subject to constraints:
2
2x + y s 12
3x + 2y s 20 2
A6. of 8

x>0, y > 0
shaded 2x + y= 12
n ploting the inequations, we notice
portion is the feasible solution.
0).
Z are A(6,
Possible points for maximum
B4, 4), C0, 10), 00, 0).
Linear Programming 309
 Value
Z= 25x + 15y
Point
150
150 + 0
A(6, 0)
I60 Maximum
100 + 60
B(4. 4)
0+ 150 150
CO, l0)
0+ 0 0
O0. 0)
4.) =4. Hence, 4pedestal lamps and 4 wood.
x =
Zis maximum at B(4, 4), i.e. for a maximum profit of
Z160.
and sold
shades must be produced
2013

[6 Marks]
Long Answer Type Questions
hectares of land to grow two cropsA and B. The
farmers has 50
7. A cooperative society of hectare are estimated as? 10,500 and?9,000 respectively.
profits from cropsA and Bperherbicide has to be used for crops A and B at the rates
of
To control weeds, a liquid respectively. Further not more than 800
hectare,
20 litres and 10 litres per used in order to protect fish and wildlife using
litres of herbicide should be this land. Keeping in mind that the
drainage from
a pond which collects is more important than earning profit,
wildlife
protection of fish and other to each crop so as to maximise the
be allocated
how mnuch land should and solve it graphically. Do you
from the above
total profit? Form a LPP of
preserve
wildlife is utmost necessary to [Delhi)
that the protection
agree with the nessage
environment?
the balance in
hectares of land is used to grow crop A and crop B respectively.
Sol. Let xhectares and y 9000y
To maximise Z= 10500 x +
Subject to constraints:
x >0, y > 0
x +y < 50
20x + 10y < 800 >2x + y 80 feasible
shaded portion asthe
notice, we have
On plotuingthe above inequations, we
solution.

310 Chapterwise CBSE PYOs(Mathematics)-12

 80%

70+

60+
50C (0, 50

B04

204 B(30, 20)

10
X
10 20 30 40 50 60

x+y=50
Possible points for maximnum profit are A(40, 0), B(30, 20), C(0,
Z= 10500x + 9000y Value (in )
50), O(0, 0).

Point
4.20,000+ 0 4,20,000
'A(40, 0)
4,95,000 - Maximum
B(30, 20) 3,15,000 + 1,80,000
CO, 50) 0+ 4,50,000 4,50,000

O(0, 0) 0+ 0
20
Profit is maximum for B(30, 20), i.e. x = 30, y =
crop A should be grown at 30 hectares of land and crop B at 20 hectares
Hence,
of land for a maximum profit of 4,95,000.
Yes, I agree.
manufacturer considersthat men and women workers are equally efficient and
.A 17 units of workers (male and
rate. He has 30 and
ne pays them at the same
respectively, which he uses to produce two types of goods A and
enale) and capital unitsof capital are required while 3
A, 2 workers and 3
to produce one unit of produce one unit of B. IfAand B are
"orkers and l unit of capital isrequired to
120 per unit respectively, how should he use his resources
PMiced at ?100 and solve graphically. Do
to revenue? Form the above as aLPP and
maximise total
the
manufacturer that men and women
workers are
gree with this view of the same rate? [All Indial
equallyefficient and so should be paid at the
Linear Programming 311
Sol. LetA units of Aand y units of B are produced. Then LPP is,
To maximise Z = 100x + 120y
Subject to constraints:
x 0 ,y 0
2 + 31 s 30 20
15
On plotting the inequations we notice,
shaded portion represents the feasible 10 Jcp. 10)
solution. B(3. 8)
5
Possible points for maximum revenue are
A(
40. B(3, 8), C(0, 10) and O0, 0). 5 10
45 20
3x 2x +3y=30
Point Z= 100x + 120y Value +
y
=
1700 + 566.67 17
4(0) 0

B(3, 8) 300 + 960 1260 t- Maximum

C(0, 10) 0 + 1200 1200
O (0, 0) 0 + 0 0

Revenue is maximum at B(3, 8), i.e., x = 3, y = 8. Hence, 3 units of A and 8

of Bmust be produced to get maximum revenue of?
units
1260.
Yes, I agree.
9. An aeroplane can carry a maximum of 200
passengers. A profit of ? 500 is made
on each executive class ticket out of which 20% will go to
the welfare fund of the
employees. Similarly a profit of? 400 is made on each economy ticket out of which
25% will go for the improvement of facilities
In both cases, the remaining profit goes to the
provided to economy class passengerS.
at least 20 seats for executive class. airline's fund. The airline reserves
However least four times as many passengers
at
prefer to travel by economy class than by the executive class.
tickets of each type must be sold in order to Determine how many
Make the above as a LPP and solve maximise the net profit of the airline:
Do you think, more passengers would
graphically.
by others? prefer to travel by such an airline than
[Foreign]
Sol. Let xtickets of executive class
and y tickets of economy class are
Then, LPP is to maximise sold.
Z= 80
J00500 x + 75
100 400
i.e. Z = 400 x + 300 y
312 Chapterwise CBSE PYQs (Mathematics)-12
 Sbjet to consraints:
200, x 20, y2 Ax ‘x20
r0.
the inequations, we notice shaded 2001
Onplottingthe feasitble
solution. Possible points 160+ B(40. 160)
proft are A(20, 80), B(40, 160),
for maximum 120+
(0. 180). 80+ A(20, 80)
X+
Z= 400x + 300y Value 40+/
Point
8.000 + 24.000 32,000
20
20. SO) 0 40 80 120 160 20%,
B40, 160) 16.000 + 48,000 64,000 Maximum
C20, 18O) 8.000+ 54,000 62.000

Proft is maximum at B(40, 160), i.e. x = 40, y= 160.

Hence, 40 tickets of executive class
and 160 tickets of econony class must be sold
of 64,000.
10 get a maximum proit
passengers.
Ves, as they care for employees and safety and facilities for

2012

Long Answer Type Questions [6 Marks]

machine A and
manufacturer produces nuts and bolts. Ittakes 1 hour of workon
10. A
produce a package of nuts. It takes 3 hours on machine
3hours on machine B to package of bolts. He earns a profit of
machine B to produce a
Aand 1 hour on package on bolts. How many packages
per
17.50per package on nuts and 7 as to maximise his profit, if he operates
each day so
of each should be produced day? Formulate this problem as
a linear
12 hours a
his machines for at the most |Delhil
programming problem and solve it graphically. produced.
Sol. Let xpackages of nuts and ypackages of bolts are Profit (in )
Machine B
Machine A 17.50
3 hrs
Ihr
Nuts (x) 1hr
7.00
3 hrs
Bolts (y) < 12 hrs
s 12hrs

Then, L.PP. is to maximise Z = 17.50x + 7y

Subject to constraints:
x>0, y20; *+ 3y s 12; 3x +ys12
Linear Programming 313
 Onplotting the graph of incquations, we notice, 16
shaded potionis the feasible solution. Possible
points tor maximm Z are A(4, 0), B(3, 3), 12 3x + y= 12
CO, 4), O(0, 0).
8
Point Z=17.50x + 7y Value
C(0, 4)
A(4,0) 70 + 0 70
A
B(3, 3) 52.50 + 21 73.50 -Maximum B(3,3)
C(0, 4) 0 + 28 28 A4, 0) x+3y =12
8
O0, 0) 0 + 0 12 16
Profit is maximum at B(3, 3), i.e. x=3, y= 3.
Hence, 3 packages of nuts and 3 packages of bolts must be produced each day to get
a maximum profit of? 73.50.
11. Adietician wishes to mix two types of foods in such a way that vitamin
contents ofthe
mixture contain at least 8 units of vitamin Aand 10 units of vitamin C. Foodl
2units/kg of vitamin Aand l unit/kg of vitaminCwhile contains
Food 1I contains l unitkg
of vitamin Aand 2 units/kg of vitamin C. Itcosts ? 5per kg
to purchase Food I and
?7 per kg to purchase Food II. Determinethe
minimum cost of such a mixture.
Formulate the above as a L.PP.and solve it graphically. [All India)
Sol. Let xkg of food I and y kg of food II are mixed.
VitaminA Vitamin C Cost
(unit/kg) (unit/kg) Rkg) 12
Food I 2 5
Food II
77 8
C(0, 8),
>8 > 10

L.PP. is to minimise
4
Z= 5x +7y
2
Subject o constraints: A(10, 0)
x>0, y20; 2x + y>8; x + 2y > 10. 2 6
On plotting the graph of
we notice, shaded portion isinequations,
solution.Possible
A10, 0),
Point
the feasible
points for minimum Zare
B(2, 4) and C(0, 8).
Z= 5x + 7y
x+
7y=
-y38
Value
A10, 0) 50 + 0 50
B(2,4) 10 + 28 38
C(0, 8) 0 +56 56
-Minimum
314 Chapterwise CBSE PYOs
 tcas1ble region is open, we plot the giaph of nequation 5x + 7y s 38 (as
the
dottedregion). We notice no point of fecasible region lies in dotted region.
1heretore. Zis minimum at B(2, 4).
minimum at B(2,4), i.c. x= 2, y = 4.
tood I and 4 kg of food I/ must be mixed for minimum cost of 38 to
2kg of
mmeet the equirements.
company produces soft drinks that has a contract which requires a minimum of
A offchemical Aand 60 units of chemical Bgo into each bottle of the drink.
0units
chemicals are availablein prepared mix packetsfrom two different suppliers.
The ? 10. The
SupplierS has a packet of mix of 4 units of Aand 2 units of Bthat costs
unit of Bthat costs 4. How
supplier7 has a packet of mix of l unit of Aand I
many packets
of mixes from Sand Tshould the company purchaseto honour the
requirement and yet minimise cost? Make a L.PP and solve graphically.
contract (Foreign]
Chemical A Chemical B Cost

4 10
SupplierS
4
SupplierT
>80 > 60

companv purchases x packets from

Let supplier T.
supplier Sand y packets from
Z=10x + 4;
: LPP is to minimise
+y> 80, 80C(0, 80)/
Subject to constraints: 4x
2+1260, x >0, y>0 60

inequations,we get B(10, 49)

On plotting the graph of
40
solution.
feasible
the shaded portion as the 20
A399
cost are
Possible points for minimum 20 40 60 80 100
A(30,0), B(10, 40), C(0, 80).
Value 10x 2x +y = 60
Point Z= 10x + 4y
300 + 0 300
A(30, 0) 260
+Minimum
100+ 160
B10,40) 320
C(0, 80)
0+ 320
of inequation 10x + ty s 260
draw the graph the dotted region.
As the feasible region is open, we region lies in
notice no point of feasible
(as dotted Tegion)and
Hence, Zis minimum at BI0, 40). 40.
(10, 40), i.e. x = 10, y = supplier
Cost is minimum at B packets from
Sand40 260.
Hence, 10Opackets from supplier cost of
I must be purchased for a minimum Linear Programming 315
 2011

LongAnswer Type Questions [6 Marks]

13. Afactory makes tennis rackets and cricket bats. Atennis racket takes 1.5
machine time and 3 hours of craftman's time in its making while: hours of
3hours of machine time and I hour of craftman's time. In a day, thecricket bat takes
availability of not more than 42 hours of machine time and 24 hoursfactory
of
has the
time. If the profit on a racket and on a bat is ? 20 and 10 craftsman'
respectively, find thes
number of tennis rackets and cricket bats that the
factory must
earn the maximum profit. Make it as a L.PP and solve graphically. manufacture to
Sol. Let x tennis rackets and y cricket bats are produced for maximum proft. [Delhi)
Machine time Craftsman'stime Profit
(in hrs) (in hrs) (in )
Tennis rackets (x) 1.5 3 20
Cricket bats () 10
<42 < 24

Then, L.PP is to maximise Z = 20x + 10

Subject to constraints:
1.5x + 3y < 42, 3x + y s 24, x >0,y >0
On plotting the graph of inequations, we notice,
solution. shaded portion is the feasible
Y

Possible points for maximum Z are 3x +y=24|

A(8, 0), B(4, 12), C(0, 14), O(0, 0). 28\
24 D(0, 24)
Point Z= 20x + 10y Value
20
A(8, 0) 160 + 0 160
B(4, 12) 80 + 120 200 +MaximumC(o, 14)
12 B(4, 12)
C(0, 14) 0+ 140 140 8
O(0, 0) 0 + 0 0 4
We notice, Z is maximum at B(4, A(8,0),
i.e.
12), 4 & 12 16 20 24 28 32
x = 4 and y = 12.
1.5x + 3y = 42
Hence, 4 tennis rackets and 12 cricket bats must be produced for the
profit of? 200. maxim

316 Chapterwise CBSE PYQs

(Mathematics)-12
14 A
I merchant plans to sell two types of personal computers - a desktop model and
aportable model that will cost 25,000 and 40,000 respectively. He estimates
thatthe total monthly demand of computers will not exceed 250 units.
Determine
the number of units of each type of computers which the merchant should stock
to get maximum profit if he does not want to invest more than ? 70 lakh and his
profit onthe desktop model is 4,500 and on the portable model is 5,000. Make
a
LPRandI solve it graphically.
Sol. Letx desktop models and y portable models are produced.
Computer Cost Proft 350
25,000 74,500
Desktop (x) 300+
Portable () 40,000 5,000 250
<70 Lakh

Then, L.PP is to maximise

CO, 175) K5x +8y
=
Z =4500 x + 5000 y 140
Subject to constraints: x >0,v >0 50+
B(200, 50)
A(250. 0)
25000 x+ 40000y s70,00,000 X
50 100 150 200 25 306350
5x + 8y s1400
and X +y 250
portion as the feasible solution.
On plotting the graph of inequations, we get shaded
B(200, 50), C(0, 175) and O0, 0).
Possible points for maximum Z are A(250, 0),
Z=4500x+5000y Value
Point
1125000+ 01125000 1125000
A(250, 0) +Maximum
900000 + 250000 1150000
B(200, 50)
0 + 875000 875000
C(0, 175)
0+0 0
O0, 0)
is maximum at B(200, 50), i.e. x =200 and y = 50.
We notice, Z
portable models must be produced for amaximum
Hence, 200 desktopmodels and 50
profit of 1,50,000. and wooden shades, each
manufactures pedestal lamps
a cottage industry grinding/cutting machine and a sprayer. It takes 2 hours
quiring the use of hours on the sprayer to manufacture a
3
on the grinding//cutting machine and grinding/cutting machine and 2 hours on
hour on the the
Puestal lamp. It takes one any day, the sprayer is available for at
the sprayer to manufacture a shade. On machine for at the most 12 hours. The
most 20 hours and the grindingwcutting from a shade is 3. Assuming that the
that
profit from the sale of alamp is 5 and
Linear Programming 317
 manufacturer can sell all the lamps and shades that he produces, how should he
a L.Pp
schedule hisdaily productionin order to maximise his profit? Make
solve it graphically.
and y wooden shades are manufactured. (Foreign)
Sol Let x pedestal lamps
Sprayer Profit
Grinding cutting
machine (in hrs) (in hrs) (in )
5
Pedestal lamps (x)
2 3
Wooden shades ()
s 12 S 20

Then, L.PP is to maxinmise Z = 5x + 3y

Subject to constraints: 72

x0,y > 0
10
2x + < 12 C(0, 10)
3x + 2y s 20 8.

On plotting the graph of inequations, 6

we notice, shaded portion is the feasible
solution. 4 B(4, 4)
Possible points for maximum profit are
2
A(6, 0), B(4, 4), C(0, 10), O(0, 0).

Point Z= 5x + 3y Value 2 4 8 10
A(6, 0)
A(6, 0) 30 + 0 30

B(4,4) 20 + 12 32 +Maximum
C(0, 10) 0 + 30 30
(0, 0) 0 + 0 0

Profitis maximum at B(4, 4), i.e. x= 4,y= 4. Hence, 4 pedestal lamps and 4wooden
shades must be manufactured to get a maximum profit of ?32.

2010

Long Answer Type Questions (6 Marks]

16. A small firm manufacturesgold rings and chains. Thetotal number of rings and
chains manufactured per day is at most 24. It takes 1 hour to mke a ring and 30
minutes to make a chain. The maximum number of hours available per dayis 16.
318 Chapterwise CBSE PYOs (Mathematics)-12
 Iftheprofiton aringiis 300 and that ona chain is 190, find the number of rings
andchainsthattshould be manufactured per day, so as to earnthe maximum profit.
Make.it as a L.PP and solve it graphically. |Delhi
LetigoldringsandIy chains are manufactured per day.
Totals 24 Time (s 16 hrs) Profit
32\
(Gold rings (r) 1hr 300

30 min 190 284

Chans ()
24c0.k4)
2 = 300x + 190y
Then, L.PPis to maximise 204
Subject to constraints:
16 B(8, 16)
x>0, y>0, 12
A+)s 24
8

ys 16 24
we notice A(16, o
On plotting the graph of inequations,
solution. 4 8 12 20 2
shaded portion is the feasible
are A(16, 0),
Possible points for maximum Z
B8, 16), C(0, 24)and O(0, 0).
Z= 300x +190y Value
Point
4800 + 0 4800
A(16, 0) +Maximum
2400 + 3040 5440
B(8, 16)
0+ 4560 4560
C(O, 24)
0+ 0
O10, 0)
16. Hence,8 gold rings and l6 chains must
8,y =
LIS maximum at B(8, 16), i.e.x = profit of?5,440.
per day to get the maximum
be manufactured
offour and 15 gof fat,another kind ofcake requires
300 g which can be
ii. One kind of cakerequires fat. Find the maximum number of cakes
190 g of flour and 30 g
of
assuming that there is no shortage of
and 600 g of fat, L.PP and solve it
hade from 7.5 kg of four making the cakes. Make it as an
(AllIndia
the other ingredients used in
made.
graphically. cakes of another kind (W) are
Letx cakes of one kind () and y
Number
Flour Fat
of cakes
(s 7.5 kg) (s 600g)
Cake 1 300g 15g
Cake 1I 150 g 30 g Linear Programming 319
 320
Sol. 18.
Subject .:. graphically.
Let should one and requires Aand We C(0,20) B(20,10) A(25, 0)Possibleportion
e LPP Item()B Item(x) A requires B factory O(0, 0) On Subject To
notice Ponr
pieces x piece 20 10 plotting maximize:
o is the minutes cakes is
constraints: to 5
makes points 300t to
factory of minutes Z the 15x
maximise of is constraints:
<3 item
of itemA minutes 8 maximum the 2y<X+
40 + 2x +
E 10x available two type 10
20+ 25 0
+
ffeasible
or Z
5x 8 Cutting 5 hrs 0+0 0+20 inequations, 30y +y 150y
+ + min min make is fortypes II maximum
20 and A for solution. < s s +
s 8y8y< x Z min cutting should 600 507500 >0, x
s >0, = y soand 5cutting at
pieces as for of B(20,
240 200 5x Value v
to that
cutting items be 20 30 25
>0
y
> + and are Z we
0 6y minAssembling maximise
of and made
8min 10 hrsS4 on A 10), A(25, notice
item 10 and +Maximum
item and 8
minutes
minutes to i.e.
B B Bget x 0), shaded x+
4 made = y50 2x
*
be profit hours is maximum 20, B(20, 2y
produced. 40F =
Profit 6. for for of y= 10), 7
10 20 50
How
? assembling. 30+ 40t
6 5 Makeassembling. for plywood.
10. C(0,
assembling.
many number 10 20)
it Hence
as 20),
20
pieces
a One BI20,10)
L.PP There One O(0, y30
piece of 20
The piece cakes, cakes 0). 40
and of are
eachprofit of i.e. of 50
[Foreign] solve of
3 itemA
type hours item 30. type
it on I
 So. 19.
solution. On
itasible Subject Let
Ihen, f,(y)Food Food(x)F, requirements.
that thas unit One foods diet A
x
i60. item of lke
=8,1= 4.
0) Pint pentsforoC
pothadieodn
plotting L.PP units
consists asafoodofunit FË is Bnotice,
to linear 0).CO.
constraints:
ofand to be 20.
is of of F,food contain 5x+6yZ= 2) the
the to food F, Long producedHence,profit 0
graph minimise VitaminA2 80 mixture contains are
programming + 120 +
0+0 1500+ 12040
F,
andeprescntsgraph
F, at S
is maNimum
6 3 contains
and available. Answer
least notieeofi
inequations,of 3x of pieces
to
maximum O0,finequations,
y 6 get the
+ these units 80 Value 0).
units 150 l60 120
6y Z= feasible
problem. 3
aitem of
units
of FoodE, units maximum are
80; 4x Minerals10 > of two Type at
food 2009 -Maxinmum
A(24,
4x + pieces lAB(8,
and solution we
6y 4
foods Vitamin ofcosts of
we + F, Vitamin
Find Vitamin Questions
notice 3y mixed.are and A profit 2020), 0).
> graphically 4 C(0,25)
also and per A i.e.
that 100; of 10 20 404 504

Liming
near Cost () units
3and A and
unit
we x2 meets [6 10 A8,20)
have 0, the 4and 100
y the ofunits unitsMarks] 20
20. um
minimminerals. F, 8y240 10x A(24, 0
shaded minimal of
costs of 30

minerals. minerals. 200

O 5 x8y
*

portion cost
nutritionalFormulate 6
per
|Delhi) for
321 as diet One unit. Two
the
 322 SolLet. 20.
Possiblefeasible Fans can and a R A cOst From Possible
B(8, solution. Sewing
weOn Subject Then,Machine this machineR sewing5,760dealer Hence, 104. of (dottedB(24.). As Point
terwise notice fans x as buy, a
B(24,).
minimum at feasible N(24)
12), plotting the l00
toL.PP. asewing to 24region) points
C(l6,points that constraints: andlinear
y how wishes
invest table,
is units region ie. (24. ) Z4x
the to machine
should fo 96+
8
(CBSE 0)for we 360x
maximise
programming
machines and to of and
x=COst 200.002000+
and havegraph Number food is +
maximum purchase notice 24,y=; isminimum 6y
PYQs
O(0, + x
2
he at240. has open minimumand )
shaded of 240y invest aHispace s F, 104.00 T06.66
0). 0, 7= purchased.are profit and no
region, 3
c(0, Cost
these of expectation a
s5760 2y 3 are Z ()
)-12 Zportion itemss problemmoney number
for point ) at
are inequalities, 0, 22x of units
xtys ? at Minimn
A(0, + 18. the of we
18y, 20
as and in of ofleasible plot
20, Assuming
order most
is fans food
20), the Cost that the 12 24 28 32
solve
240 360 () to he 20and F, regiongraph
1Co
0
items. 4
maximise it must
10 15+20%A(0,20) graphically.
5760 s that can sewing
5 8
lies of 12
5
hesell A mixedbeinequation
360x f an in
can machines.a 16
+ 15
10 B(8,12) the fancosts dotted
sell 20
240y profit? at to
all a 24
OA6,
= get region, 4x
5760 him360
theprofit22of He
104 y Ax
C16, 0) Formulate minimum a +
Inda)[All items has
xty= 20 So6y s
only
he and Zis 104
 l. 21.
1or and LPP Let of
Hence,
of of S O(0,0)C(0,20) B(20.10) A(25.0) 0(0,0).
We shaded On Subject Cake IICake I the One bu.heFrom C(l6: 0)
JO0. 0) BI8. 12) lA(0. 20) Point
cakes notice, Point
maximum ploting is progracakesmmiproblnxgemotherand rmadeequirhees kind
to to table.
within 20 portion 100 of 22x+Z=
18y
cakes Z constraints:
200x maximise of COst
is Z=xt y ingredients from gcake 352 +
0 176216 +
straints. 10
+ 25+0
Z isthe 25x (5000g)
Flour type of is 0+0 3600+
0+0 0+
20 20 are graph
feasible I 5flour
requires
maxitypemum A(25,
x+ + 2x100y + 100g 200g and kg maximum
+y Z=x+y
x
/and of 2y50y <
S s >
y used ofand
at Value s 352 392 360 Cost()
20 30 25
u0)t,ion.ions,
isolnB(20,equat 401000 505000 0, cakes solve flour 50200
in at
10B(20, y
>0 g g
cakes and of of B(8,
10), Possi
l0), ble
1000g)Fat (Stypeofmaking fat. +Maximum
+Maximum 50g 25g graphicall. I flour 12),
ofi.e.
C(0, we kg Find
type are
II the
of and i.e.
x= 20)poi, ntsnotice
ll 20, fat the 25
must made. cakes.
assuming fans 8
y 40+
be = 30 Formulate maximum ofg and
nearing 323 10. C020), \ fat,
made 10 12
that and sewing
for 20
30
y
number
2x
the there another
maximum + A(25, B(20,10)
y= above
50 is of machines
cakes kind
as no
number X+2y= a
(Foreign]shortage
linear which cake of should
40