( O~ECTIVE Type Question0

[ 1 mark]
Multiple Choice Questions
1. The solution set of the inequality 3x + Sy < 4 is: (a) Point 9
(a) an open half-p~ane not containing the (b) PointC
origin. ._ (c) Point D .
(b) an open half-plane containing the origin. (d) Every point on the Line segment CD
(c) the whole XV-plane not containing the [CBSE Term-1 SQP 2021]
Une 3x +Sy= ,~. . . ,
(d) a closed half plane containing the origin. Ans. (d) Every point on the line segment CD
[CBSE SQP 2022) Explanation:
t ' f .. , • z is maximum 180 at points C (15, 15) and 'D
Ans. (b) an open half-plane containing the origin.
(0. 20). .
Explanation: The strict .inequa lity represents ~ z is maximum at every point on the Une
an open half plane and it-contains the origin as
segment CD
(0, 0) satisfies it [CBSE Marking Scheme SQP 2022)
[CBSE ~a~ng .Scheme SQP 2022]
The corner points of the feasible region are A(O,
2. @in the given graph, the feasible region for 10). 8(5. 5); C(lS, 15) and D(0, 20).
a LPP is.shaded. - I

y Comer Points Objective Function

Z= 3x+9y
-·
(4. 10) A (0, 10) 90 I
1 "',.., I r'

B (5, 5) 60
,: -c (15.15) 180 (maximum)
(6,8)
D (0, 20) 180 {maximum)
, ' .: :: Since·maximum valu~·of Z occurs at two points,
(6, 5)
_ ; , i namely C· and D, so every point O(I the Une

'· . segment joining the points C and D gives the

maximum value. ·
4. Corner points ~f the feasible region for an
LPP are (0, 2), (3, 0), (6, 0), (6, 8) and (0, 5).
=
' ' ' · Let ·F' 4x + 6y be objective function. The
Minimum value of F occurs cit:
(5. 0) . (a) (0, 2) O(lly
The objective function Z = 2x - 3y, will be (b) (3, 0) only
minimum at
.) (c) the mi~ point of the Une segment joining
,
1
(a) (4, 10) (b) (6, 8)
the points (0, 2) and (3, 0) only.
(c) (0, 8) (d) (6, 5)
(d) an~ point on the Une segmentjoining the
[CBSE Term-1 SQP 2021]
points (O, 2) and (3, 0). [NCERT Exemplar]
3. Based on the given shaded region as the Ans. (d) an~ 'point on the line segment joining the
feasible region i11 the graph, at which point(s) · points (0, 2) and (3, 0).
is the objective function Z = 3x + 9y maximum?
y -\Explanation: Here, objective function is
F = 4x+ 6y
Comer points F-4x+6y
(0, 2) 12 (Minimum)
(3. 0)
--
12 (Minimum)
(6, 0)
24
(6, 8)
7 ~ (Mo&'!'umL__
(0, 5)
30
X'~~-+~-++-t-++-+- +-~~. - ~x ·
Hence, the mi nimum ·
35 value of F
on the line segment . . . occurs at points
00) . (3, 0). • J_o,mng the poi'nts (0, 2) and
Y' ' x + y = 10
1
 caution
ft.,. ,n,er,e
,,, could be more
. ,·...,um value occur.
(Tl,n I "
than one p .
omt at Which
7 • The ·feas ible
region, for the ineq uali ties
x + 2y s 6, !:J 2:: 0, 0 s x lies in:
!,»n., (a) first qua dran t
5. 15''"e feas ibleb regi
l
on for an LPP ·, h
s s own
(b) seco nd qua dran t
In the. figfuurect.e owM. Le~ F = 3x - 4y be the (c) third qua dran t (cf) four th qua dran
t
objective n ,on. ax,m um valu e of F is: [Delhi Gov. 202 2]
Ans. (a) first quadrant
Explanation: Since, x ~ 0, y ~ O
So, feasible region will lie in the first quad
rant ,
as in the first quad rant both x and y are
equ al
to or grea ter than zero. '
8. @For an objective· function Z = ax + by,
whe re a, b > 0; the corn er poin ts of
the
feas ible region dete rmin ed by a set
of
con stra ints (line ar ineq uali ties) are (0,
20),
(10, 10), (30, 30) and (0, 40). The cond
ition
on a and b such that the max imu m Z occu
rs
(a) 0 at both the poin ts (30, 30) and (0, 40) is:
(b) 8
(c) 12 (d) -18 (a) b - 3a = 0 (b) a = 3b
[NCERT Exemplar] (c) a+ 2b = 0 (cf) 2a- b = 0
6. In a line ar prog ram min g prob lem [CBSE Term -1 SQP 202 1]
, the
cons train ts on the deci sion vari able s x 9. ®rh e corn er poin ts of feas ible regi on
and y
are x - 3y 2:: 0, !:J 2:: 0, 0 s x s 3. The feas for a
ible line ar prog ram min g prob lem are P(O,
region: _5),
Q(1, 5), R(4, 2) and S(12, 0). The min imu
(a) is not in the first qua dran t. m
valu e of the objective func tion Z = 2x +
Sy is
(b) is bou nde d in the first qua dran at the point:
t.
(c) is unb oun ded in the first qua dran t. (a) P (b) Q
(d) doe s not exis t. (c) R (cf) s
[CBSE Term -1 SQP 2021] [CBSE Term -1 202 1]
s. (b) is bou nde d in the first qua dran t 10. If the objective func tion Z = ax
+ y is
min imu m at (1, 4) and its min imu m valu
Feasible region is bou nded in the first e is ·
13, then valu e of a is:
quad rant . (a) 1 (b) 4
[CBSE Mar king Sch eme Term -1 SQP 2021] (c) 9 (cf) 13
Explanation: The graphical representatio ~ [Dttlhi Gov. 202 2]
n of Ans. (c) 9
linear inequations x - 3y 2: 0, y ~ 0 and O s
xs 3 Explanation: Here, Z = ax + y
is shown below.
At (1, 4),
13 = a(l) + 4
G= 9
11. @A line ar prog ram min g prob lem
follows: is as
Minimise Z = 30x + SOy
subj ect to the con stra ints ,
3x+ Sy 2: 15
2x+ 3y s 18
Xi?: 0, !:J 2:: 0

In the feas ible region, the min imu m valu

Z occu rs at: e of
•.
(a) a uniq ue poin t
(b) no poin t
(c) infinitely man y poin s
So the feasible region is bou nd ed a nd (d) two poin ts only
/ lies In
first quad rant . [CBSE Term -1 SQP 202 1]

Lin ear Pro gra mm ing ~ 45 9

 12i.~~ x + y s 2, x, y == 0, the point at which
maxi mum value of 3x + 2y attain ed, will
· be:
(a) (0, 2) (b) (0, 0)
, • J

(c) (2, 0) (d) ( ½, ½)

Ans. (c) (2, 0)
✓ Expltanation: The corne r points of the feasible
•

. :: >~ ;:-=: ~<

region are: (2, 0), (0, 2) and (0, 0). :x ·. ..
,y .
-. .
. ..__
~

Z=X+Y
Z = 10
The values of Z at these corne r points are 6, 4 x+ y < 10
and 0, respe ctively. Thus, minim ise Z = x + y has an optim al solution
Thus, Zmax. = 6 at (2, 0). with respe ct to the given set of const raints.

13. The ·-constraints of a -Unear programming 14. The shaded region show n in the figure, is
1Problem along with their graphs is show n given by the inequaUties:
below: y
.
x+ 2yc: 3
(19, 14)
10
Xi!::

yc:0
30 Y

25

20
(a) 14x + Sy == 70, y s 14, x - y s S
15 (b) 14x + Sy i!: 70, y s 14, x - y s S
10 (c) 14x + Sy s 70, y s 14, x _ y l!:: 5
(d) 14x + Sy s 70, y l!:: 14, x _ y l!:: S
y=1_ 0-r--- +-':a .....-.. --4--- .--..-- Ans. (a) 14x + Sy 2: 70, y :s 14, x- y :s
5
-5 Explanation: Let A(S, 0), 8(19, 14) and C(O, 14).
-5
So, equat ion of line AB is:
x= 10
Which of the followJng objec tive functi ons (y - 0) = (14- 0)(x - 5)
19 - 5
has an optim al soluti on with respe ct to the
above .s et of const raints ? => Y=X -5
(a) Minimise Z = x + y => x-y= S
{b) Minimise Z = 0.Sx + ~u Since, the feasible region of the line AB contains
li
the origin, so its equal ity is x _ y s s.
{c) Maximise Z =x + y
Similarly, ineq1.,1alities of lines BC and AC are
(d) Maximise Z = 2x + y
y s 14 and 14x + Sy 2: 70, respectively.
[CBSE Question Bank 2023)
Ans. (a) Minim ise Z = x + y 15. In a Unear progr ammi ng problQITI, if the
feasib le region Is bound ed then o bjective
Explanation: Here, corne r point = (10, 0) functi on Z = px + qy has: ,

46() . ~ Edu ~ort Math ema tic5 Class XII

, a1t'fffft-
 imum
Condition on p and q so tha t the max
(a) max imu m valu e onl y 4) and (0, S) Is:
of z occurs at both (3,
(b) minimum valu e onl y (b) p = 2q
m value (a) p = q
(c) both max imu m and minimu (d) q = 3p
m value (c) p = 3q
(d) neit her max imu m nor minimu
[Delhi Gov. 202 2) Ans. (d) q = 3p
e of Z be
m value Explanation: Let, the maximum valu
/4.f1S. (c) bot h max imu m and min imu
problem, M. Then,
Explanation: In a linear programming ...(0
objective At (3, 4), M = 3p + 4q
if the feasible region is bounded then ... (iO
imum and At (0, 5), M = Sq
function Z = px + qy has bot h max
minimum values. From (i) and (ii), we have
3p + 4q = Sq
s,6. @ The com er poi nts of the sha ded 3p =q
LPP are ⇒
unbounded feas ible region of' an
wn In the
(0, 4), (0.6, 1.6) and (3, 0) as sho
figure. The min imu m val ue of the
objective Assertion-Reason Questions
tem ent of
function Z = 4x + 6y occ urs at: In the foll owi ng que stio ns, a sta
sta tem ent of
Ass erti on (A) is foll owe d by a
Reason (R).
the foll owi ng
Cho ose the correct ans wer out of
• I
choices.
{R) is the
(a) Both {A) and (R) are true and
correct explanation of (A).
is not the
(b) Both (A) and (R) are tru e but {R)
correct explanation of {A).
{c) {A) is true but (R) is false.
(d) (A) is false but (R) is true .
function
18. Assertion {A): For an objective
{a) {0.6, 1.6) only Z = 15x + 20y, com er poi nts
(b) (3, 0) only are {0, 0), {10, 0), (0, 15) and
{5, 5). Then opt ima l val ues are
(c) {0.6, 1.6) and {3, 0) only
mentjoining 300 and O resp ecti vely .
(d) at every poi nt of the Une-seg
the ·points {0.6, 1.6) and {3, 0) Reason {R): The ma xim um or min imu m
[CBSE SQ P 202 2] valu e of an obj ecti ve fun ctio n
is kno wn as opt ima l val ue of
of lam p
17. Sam ma nuf act ure s two typ es LPP. These val ues are. obt ain ed
um num ber
<&hades, A and B. The ma xim at com er poi nts.
of hours a ,day req uire d to ma
nuf actu re
one lam p Ans. (a) Both (A) and (R) are
true and (R) is the
two lam p sha des of typ e A and
ere as, the correct explanation of (A).
shade of typ e B is 10 hours, wh
required ma xim um
maximum num ber of hou rs a day Explanation: We know that, the
de of typ e A e fun ctio n
to manufacture one lam p sha or min imu m value of an objectiv
hours.
and thre e lam p sha des of typ e Bis 15 is known as the op1tim al value
of LPf. These
ts.
values are obtained at cor ner poin
= 15x + 20y,
For the given objective fun ctio n Z
w
the corner points tab le is given belo

Corner pol11t1
t - i • iSl( -t 20y
(0, 0) 0 (minimum)
- -- r---

region
-
,-
(10, 0)
(0, 15)
150
300 (maximum)
--
-- -

The corner points of the feasible (5, 5) 175

r lneq uaU tles
determined by a sys tem ofU nea imu m) are
Opt ima l value (ma xim um or min
are (0, 0), (5, O), (3, 4) and (0, 5).
300 and O from the table.
let Z =px + qy, wh ere p, q > 0

Linear Pro gra mm ing ~ 461

 So, shaded portion is towards the origin.
19. Assertion (A): Consider the linear
program ming problem. .-. The corner points of shaded region are
Maximise Z = 4x + y
Subject to constrai nts 0(0, 0), A(2, 0) and B(0, 2)
x + !I. s so, x + y it 100, and At point 0(0, 0), Z =3(0) + 2(0) =0
x, y it 0
Then, maximum value of Z Is SO. At point A(2, 0), Z = 3(2) + 2(0) =6
Reason CR): If the shaded region Is not At point B(0, 2), Z = 3(0) + 2(2) = 4
bounded then maximum value
cannot be determined. Hence, maximu m value of Z is 6 at point
Ans. (d) (A) is false and (R) is true. (2, 0).
Explanation: Given, Maximise, Z = 4x + y and
X + y :S 50, X + y c?: 100; X, y c?: 0 21. Assertio n (A): Objectiv e function
y Z = 13x - 15y is minimised t
Subject to the constrai nts
X + y S 7, 2x - 3y + 6 ~ 0,
x2:: .0,y 2:: 0
y

B (100, 0)

Hence: it' is clear from the graph that it is not

bounded region. So, maximu m value cannot be
determin ed. . , ...
X
20. Assertio n (A): Maximu m value of Z = 3x +2y,
subject .- to the constrai nts 2x-3y+ 6~ 0 x+ys7
x + 2y s 2; x 2:: O; y 2:: 0 will be Y'
obtaine d at point (2~).
,._ .The minimum value of Z is
Reason·(~: In a bounded feasible region, it -21.
.,
., , -
· always exist a maximu m and
minimu m value.' · _.. , . Reason (R): · Optimal value of an objective
An-. (b) Both.(A) and (R) are true but (R) is not the ! · · function is obtained by
correct exp_
l anation of (A). comparing value of objective
Explanation: ..;. _ function at 'all comer points.
Given, : x + y :s 2, x .e Oand y .e 0
~_- An~ (d),(A) is false but (R) is true.
let Z= 3x+2y
Now, table for x + y= 2 . Explanatl~n~ . ·-, Shaded region - shown as

l:l~l~l~ls
',, OABC is bounded and coordi~ates of its
corner points are (0, 0), (7, 0), (3. 4) and (0, 2)
respectively. , . ·. . • .
At (0, 0), 0+0 2
0 :s 2, which is true. ~ffltrPOlnta ~
y
wt..o f
Za1h ..,t5u
(0, 0)
0
(7, 0)
91
(3, 4)
-21
(0, 2)
-30 +- Minimum
Hence, the minimum value 'of -~bjective
function
_ __ Is . at corner point (0, ·2) . W. h;ICh is
30
 ( CAS E BAS ED Que stio ns (CB Qs} )
[4 &5 marks ]

,uad the followi ng passag es and answe r the the point (2, 1), B is the point (2, 7) and c is
questions that follow: the point (6, 3). The shaded region R is defined
by three inequalities. One of these three
given below. 0 is the origin, A is
22. /n the figure inequalities is x + y s 9.

(A) ©rhe other two inequaUties are:

(b) X s 2, 2y s X (b) (4~3)
(a) X 2: 2, 2y 2: X ' (a) (0, 2)
(b) X 2: - 2, 2y :S X (d) (2, 0)
(c) X 2: - 2, Y 2: 2x (c) (3, 1)

(B) Given that.th e point (x, y) is in the region Ans• ._(B) (c) 21 -
Explanation: The corner P.<;>ints of the fea-
R, the maxim um value of Z = 3x + Y is:
sible region Rare: A(2, 1), 8(2, 7) and C(6, 3).
(a) 7 (b) 13
(d) 26 So, ZA = 7, Zs= 13, Zc = 21
(c) 21
:. Zrnax = 21
(C) ®Given that the point (x, y) is in the region
(D) (a) 12 sq. units
R, the minimu m value of P = Sx - 2y is:
Explanation: Area of region R
(a) -8 (b) -4
= Area of AABC
(c) - 24 (d) 8 1
1 X.1 !:/1
!:h 1
(D) Area of the region R is: = - X2
2x !:/3 1
(a) 12 sq. units (b) 15 sq. units 3

(c) 18 sq. units (d) 24 sq. units

Linea r Progr amm ing I& 463

 2 1 1 23 • In the figure, 0 is the origin, A is the Point
=.!2 7 1
2 ( 1: , O ) , 8(6, 3) and C(O, 5). The shaded
6 3 1
= .! (2 (7 - 3) - 1(2 - 6) feasible region Is defined by three non-trivial
2
+ 1(6 - 42)] inequalities and two trivial inequalities. One of
1
= - x 24 the three non-trivia l inequalities is x + 3y 5 _
2 15
= 12 sq. units

: :_'._ !; . 1 ".·L :i•i 't' ,! JlJf. jJ I. t. i \! ~1,1111_ I! • h, I - .f' t ! , ,i • , , . , .,

HI 1-''- · .t t··, , ~
Ill " iii ii i " , - 1· ,-.
< • •' ••·:y· '· 1 • ·F 1,1·- 1; L . :Ht
l ! :l!
, -7.r•
t .. • ~ · ! , , •1_( •. • 1. q; •
I •~ _ 111
... _ _ +I
! l ·'! · J 1;, '. · ·ill} r·•
1 • ,i • . . 1 1 ~I I 1
1 1

' 4- I-- i ....... - ....

: · : ~ - -n ...•• ~ -
.... -+r ·I-+-- . : r -r-!&.-.
" ' . ; +- ,; ·,
-~~,-. ~--
-:~~
" ./.+ -.

, . . ' .
+•-➔- . +t- .,.

. t+- ... .., ' -.

. . ri:: ;- ·ri :·
- -1 7T l 'T i +t..- JiT 1 nr ... t

(A) Write the other two non-trivial ⇒ x+ 2y = 12

inequalities plotted on the graph.
And, equation of a line joining the points
(8) ©Find the corner points of the feasible 1
(0, 15) and, ( ;, O) is:
region.

(C) ©Given 1nat the point (x, y) is In the region

Y - O -_ 15
0-15 (
x -15)
-
R, find the minimum value of (6x - Sy). - -0 2
2
Ans. (A) Equation of a Line joining the points (0, 6)
5 5
⇒
and (12, 0) is: ~ Y = -15( X - ~ )

y - 6 = O - 6 (x - O) ⇒
Y = - 2x + 15
12 - 0
⇒ 2x + y = 15
. -1
y-6 = -(x) By observing the feasible region R, the
2
inequations of these two equations are
⇒ 2y-12 =-x x + 2y s 12 and 2x + y s 15.
This,_ graph '._,is constructed usi[lg_1, three non- .(E) Given that the point (x, _y ) is in the region
trivial constraif!t§ .and two trivial constraints. R2 , find the maximum value of Sx + 2y.
One-, of . ,the no_n-trivial 1COJ?~ r'?ints is (a) 400 (b) 300
x+2y~ 100. (c) 500- (d) 600
(A) ®what are th~ two trivial,constraints? Ans. (8) (a) 2x - y ::5 0. 2x + y :5 200
(a) x :$; 0, y ii!: 0 <(b) ·y i!!:!O, 0. ~., Explanation: From ~he ijg~re, th~ r~gion R1
is bounded by the ineguality x + 2y 2:: 100
.. .. ' ·'y. :5 0
(c) x ii!: O, y ii!: O . (d) x..,..2:: Q,
DC.
and the lines BC and
(B) Considering ~1,as tl:ltl: feasible r~gipn, find
the ott:,er two non-trivial c9nstrairts. Now, equation Line BC is:
(a) 2x - y ~ 0, .2x + y :5 200 - 40 = 100 - 40 (x - 20)
y 50 - 20 '
(b) 2x + y 0, 2x + y = 200
~

(~ 3x + y ii!: 0, 3x- y :5 200 , c:" i.e., 2x - y = O; and

--
+
(ci) 4x 2y .f•·o, Sx +·y = 200
1 " ' •~" ,_ ,T , j ~ . (
Equation of Line DC is:
(C) @Considering R2 as the feasible region, y - 200 = ( 100 - 200 )ex - 0)
find the other two non-triv ial constrai nts. . 50 - 0
(a) 2x - y ii!: 0 and 2x + y :5 200 i.e~ 2x + y = 200.
{b) 2x + y 2:: 0 and 2x ..: y :5 200 To find the sign of inequality of these two
I
(c) 2x - y ::5 0 and 2x + y ii!: 200 Lines, take any point from the feasible
(d) 3x + 2y ::5 o .and 3x - y i!!: 200 1 region R1, say (20, 60).
(D) @Given that the point (x, y) is in the Now, at (20, 60)
region .R1, .find the _maximum value of 2x - Y = 2 X 20 - 60
Sx+ 2y. =-20 s 0
(a) 400 (b) 4.5~ ⇒ 2x- y s 0
(c) 500 (d) 600

Linear Progr ammin g ~46 5

 and 2x + y - 200 = 2 >< 20 + 60 - · 200 ' Explanation: · The corner points of th
= 100 s 0 feasible region R2 are: 8(20, 40), C(S0, 10~
and E(100, 0).
:. 2x + y - 200 s 0, or 2x + y s 200
So, the other two inequalities are: 2x - y s 0, Now, (5x + 2y)s = 180, (Sx + 2y)c = 4SQ
2x+ y s 200. (5x + 2y)e = 500 ·

(E) (c) 500 So, (Sx + 2Y)max = 500

( VERY SHORT ANSWER Type Questions (VSAj_)

[ 1 mark]

25. Rnd the maximum value of the function

Z = Sx + 3y subjected to the constraints x ~ 3
and y ~ 3.
Ans. Here, value of Z at the corner point (3, ·3) of the
feasible region is 24.
y

y'
Ans. Here, the objective function is Z = 11x + 7y.
'X~:d---1----+-~---.:..-.➔ X
. - And the corner points of the feasible region are
◄
Sx+ 3y> 2_4
.A(3, 2), 8(0,_3) and C(0, 5).
Y' :. AtA(3, _2), Z = 11 x 3 + 7 x 2
. .
Since, region is unbounded, so we draw the = 33+ 14=47
AtB(0, 3), Z=11x0+7x3
graph of inequality 5x + 3y > 24.
= 21 . 111
:·

Since, open .half plane of 5x + 3y > 24 has AtC(O, 5), Z=llx0+7x5

common points with feasible region.
=35
So, maximum value does not exist. Hence, the minimum value of z is 21 which
occurs at point 8(0, 3).
26. @what type of polygon is formed by the
' (

feasible region for an LP.P.? 29. What is the condition x ~ O, y c!:: O in Unear
· · · programming called? ,
27. ®rhe feasible solution for a LPP is shown in
Ans. This coridition is called the non-negative
the following figure. restriction i.e., x and y could not have the negative
y values. . , ·
(4, 10)
30. Feasible regio~ (shaded) for a LPP is shown
co:i>8 (6,8) in the figure below. Maximise z ~ Sx + 7y.
6 y
(6, 5)
4
8
2
~-0.,..,._;:~~~~-+--+--t-~ X
2 4 6 8 10

Let Z = 3x - 4y be the objective function. Then,

at what point minimum value of Z occurs.

28. The feasible region for an LPP is shown in

the following figure. Then, find the minimum ~! / '

value ofZ = 11.x +7y. [NCERJ" Exemplar]

466 .¥4. fSMk9'fvfflfQ89!Jjfj Class XII

 s. ,he shaded region is bounded and has
Corner po~ Z = Sx + 7y
/,JI coordinates of corner points as (0, O), (7, O), (0, 0)
- 0
--
(3, 4) and (0, 2). (7, 0) 35
Z = Sx + 7y (~. 4) 43 (Maximum)
AlsO,
(0, 2) 14
Hence, the
- -
maximum value of Z is 43 which
occurs at point (3, 4).

~HOR T ANSW ER Type-I Questio ns (SA-I))

[ 2 marks]

3s,. In the figure given below, the feasible region ~+ 30 = 36 = 9 (maximum)

2 4 4
(shaded) for a LPP is shown. Determine the
,naximum and minimum values of Z = x + 2y. Hence, the maximum and minimum values ofZ
[NCERT Exemplar]
are 9 and -22 , respective
. l
y.
7
32. Maximise Z = 3x + 4y, subject to the
constraints: x + y ~ 1, x i!: 0, Y a: 0.

3 2 [NCERT Exemplar]
P13'1
(
Ans. Maximise Z = 3x + 4y

Subject to constraints

x+y~1
X ~ 0, y ~ 0

For x+y=1
Ans. From the shaded region, it is clear that the

coordinates of corner points are ( / · ~;

3 l· E : T'
1
0 I
0
1

18 2) 3
(7 '7 · (72· 4
3) nd (3 15)
a 2' 4 ·
2
Here, objective function is

2 =X + 2y
--
)(
r---. ~

1~~:,..
Corner Z;:: X + 2y .. )l."' 1 X
poJnt, x'
- --- - - Q ·H-t "L
2 3 4

l
>
3 48 51 i~I y• ·_
( 3 24 - +- = -
13' 13 13 13 13
- -- - Corner points 7 Z a 3x + -4t,
· - - ----__;c :.---i
(1a
7'7
I) 18 + 4
7 7
=
22
7
(minimum) (0,0) I
--- - - · - - - - - - - - + i -- - - - - --1
0
- - (1, 0) I 3

(~ I)
2· 4
7 6 20
-+-= -=5
2 4 4
(0, 1)
- 4 (Maximum)

Hence the maximum value of Z is 4 at (0, 1).

 ·.( SHORT ANSWER Type-II Questions (SA·II>)
[ 3 marks]
33~ Solve the following LPP graphically: Convert the In equations to equations, to Plot
them on the graph.
Mini.:nise, Z = Sx + 7y
Subject to the constraints For the line 2x + y = 8
2x+yi!:8 0
x+ 2y ii: 10 8
x, y ii: O [CBSE 2020)
And, for the line x + 2y = 10
Ans. Given, we have to m inimise
Z = Sx+ 7y
Subject to the constraints,
x
y
O
5
10
0
I_
2x+y~8
Plotting these points on a · graph, we get 0
x+ 2y ~ 10
feasible region (shaded) which is unbounded.
x,y ~o

The corner points offeasible region are D(O, 8), minimum value of Z is obtained at E(2, 4) and
' 8(10, 0) and E(2, 4). ' the minimum value of z is 38. ·. ·
-~'- ~i-~iii11~~-..,., 34. ®oetermlne the maximum value of
Z• 11x + 7111ubJect to the constraints:
so 2x +II s 6. X s 2, xii: 0. 51 a: 0. [NCERT Exemplar]
38 Minimum 35, Maxlml11 z • 2x + 3i,
Here,·39 is the minimum value at E(2, 4). But 1ubJect to con1tralnt1 ' '

the region is unbounded, so we draw the graph x+ 211 s 10

,_ ,ofine~uaUty Sx + 7y < 38. 2x+ II s 14
Now, inequaUty Sx + 7y < 38 has no point
and x•·o,!I a: 0
i t in common with the feasible· region.' So, the Ana. Given, maximise z = ·2x ~ 3y .
 subject to constrai nts .
x+ 2y s 10
2x+ y s 14
... (Q
...(iQ
l~-+
__ y ~
For the Line 2x + y = 14
0 ---, 10
5 1 0
j
_,
I
x~ O,y ~ o
. . ...(iiQ
Convert inequati ons to equation s to l
on the graph.
For the Line x + 2y = 10
P ot them
6! 1 ~4 -i ~
Now, pl~tting ti:iese points on a graph,- we get
. . "' , __ the feasible region (shaded) which is bounded .
.~_q__ l l\llk-1"·_ :: i-,i :::,c,:-,,"iiitJi-- . . -!•' •- . , .

The corner points of the feasible region are no more than 10 hens. -On an average it will
0 (0, 0), A (0, 5), B (6, 2) and C (7, 0). cost him Rs 25 ana Rs 75 per day to raise
one hen and one cow respectively. He will
Comer Z=2x+ 3g·· make an average profit of Rs 12 from each
Points - - hen and Rs 40 from each cow every day. He
has a budget of Rs 900 per day to raise the
0(0, 0) 2=0 animals. How many of each type of animals
should he raise to maximise his profit?
A{O, 5) Z =2 X 0 +3 X 5 = 15 [CBSE Question Bank 2023]
8(6, 2) Z =2 X 6 +3 X 2 = 18 ➔Maximum Ans. Takes the number of hens and cows to be
x and y respectively and formulat es the Linear
D{7, 0) Z =2 X 7+3 X O = 14 program ming problem as follows:
~

Hence, the maximu m value of Z is 18 at the Maximis e Z = 12x + 40y

Point 8(6, 2). Subject to constrain ts, 25x + 75 y s 900
36• ~rarne the below optimisation problem a~ a X + y S 16
XS 10
linear programming problem and determine
Its feasible region graphically. X 2: 0
Bhavani Singh, a farmer, decides to raise y 2: 0
hens and cows to make some extra money Graphs the constrai nts and marks the feasible
0 Part from his agricultural income. ~e wa~ts
region as:
to raise no more than 16 animals including

Linear Progr ammin g ~ 469

 - (
x+ 2y ii!:: 100
2x-y so
2x+ y :s 200
x, y 2: 0
Solve the above ~PP graphicaUy.(CBse
201
Ant. Given, Max. and Min. Z = x + 2y 7J
Subject to the constraints,
x+ 2y ~ 100
~(i)
2x-y s O
...(I~
2x+ y s 200
...(Ii~
and x ~ 0, y ~ 0 (I
Now, convert given inequalities to equaliti~,:
plot them on the graph.
For the line x + 2y = 100

y
0
so 1~0 l
For the line 2x-y =0
X 0 10
I y 0
And for the line 2x + y = 200
20

X 0 100
y 200 0
37. Maximise and minimise Z = x + 2y Plotting these points on graph, we get a
subject to the constraints feasible region (shaded) which is bounded.
 n,e comer points of the feaslbl
A(O. 50), B (20, 40), C (SO, 100) ande . re
~(6i~~o' The maximum value of Z Is 400 at D(O, 200)
and the minimum value of Z is 100 at the
corner Points Z=Xlf-2y , points A(O, SO) and 8(20, 40).
-
-
L.:---"
A(0, 50) z = O + 2 >< so =100
38. @solve the following Linear Programming
6(20, 40) z =20 + 2 )( 40 - 100 Problem graphically:
-
C (SO, 100) z = so + 2 )( 100 =250 MaximizeZ=400x+300ysubjecttox+ys200,
D(0, 200) z = 0 + 2 >< 200 =400 x s 40, Xii!: 20, y ii!: 0 [CBSE SQP 2022]

( LONG ANSWER Type Questions (LA) )

[ 4 & 5 marks]

3
9. Maximise Z = x + y subject to x + 4y s
2X + 3y :S 12, 3x + Y S 9, X i?! 0, y i?! 0.
a,
-=-- -1-~-_____,J
1·'-z"- --~l~
For equation 3x + y = 9
Af!S. We have, LPP is
maximise Z = x + y
Subject to constraints
x+4y :S 8 For equation 2x + 3y = 12
2x+ 3y :S 12
3x+y:S9 I~ I~ __ I~ I
Plotting these points on the graph, we get the
x ~0.y~0
feasible region which is shaded.
For equation x + 4y = 8
y

7 ~
~
~
\\
6 IP

I.

3
<..i-
(0, 2) ""~:y~ ./< (28 15)

•,
~:~
11 ' 11

(3,0
8 9 X
X 5 6 7
3 4
1 2
0

T281sr-TI3
~=d
r -

.,,._r • 11
11'11
Zmx+II
Comer points
00 0
-

ll~- ---=t---=---
Ji_o)_ _ ___ ---
3 - --
Linear Programming ~ 471
 , x-ys6 ( I
'. Hence, th'e maximum value ofZ is 43 at point
(28 15)-' 11 For the equation x - 2y = 0
• I f f
x,y;:::O

11·11
·· 40. Maximlse and minimise Z = 3x - 4y ·
subject to x-2y so ·
~~~~ lg I~ 3
For equation -3x + Y = 4
,..{ . -3x+y S4 I, '(·

!;1
Ans. Given, LPP 1s
x-ys6
x,y ~o
,,
a·
For equation x _.:. ~ 6
! '
- ~

Y
3
Maximise and minimise, Z = 3x - 4y
Subject to x-2y so
-3x+y :s; 4 l~
. -~ . . ~

I~ I~ 6 :j
tt X

12 ml
= 1
10 :tr~
!'
I

6{
~
u ':).re,
6 .,I
~ 12 6
'
, '?+'

..::-').:
... 2 a:ua, ')..~

. x~
1
IF-12 .... () - 45 _, 1~2
i..,_,

tt1 ' ~
4
X

\.').:
- ,\.~
,1>1~
if±flf±I±
"' ~.....rlf!E7'<o ~

:J:lffl-4 'l+t+tl"'~
.
+x
t-

... - +I ..........
·-
L:l

mu ffm

12· ·~and
__ Now, to decide whether 1
Plotting thfie points on a graph, we get a -6 are
feasible region which Js unbounded., respectively , u;te · maximum and minimum
. .,.........__,,, ...,...:"""""~--~.....-.......,....-,..., · values of Z ·. not. plot the inequolitieS or
~ 3x-4y > 12.and 3x-4y <-6.
From the gr~~~ it is clear that thEt inequalities
(0,0) 0 3x - 4y > 12 ahd 3x- 4y < -6 has no point in
(0,4) -16__{~1nlmum) common with the r.asible region.
· H,ence, the maximum value of z is 12 and itS
(12, 6) 12 (Maximum) minimum value is -6.
\ \ ;

Detailed solutions for

@Self-Practice questions
accessible here Ii]-"~
.,
~ ·•
• .,_J
, .
 .TOPPER'S CORNER

(OBJECTIVE Type Questions)

\ ., [ 1 mark]
\\
\' t,4uftiple Choice Questions
\
' \ 1- The corner points of the feasible r · a •
. egion eterm1ned l;y the system of linear inequalities are (0, 0),
(2 4) and (0 5) If th
'\ \ I (4• 0)'th, ' · e maximum value of z = ax + by' whete a' b > o occurs at both (2, 4) and
\
~~ ~

(a} a =2b (b) 2a =b (c) a= b

[CBSE Topper 2020)

( LONC ANS~ER Type Questions (LA))

[ 4 & 5 marks]
2. Afurniture trader deals in only two items - chairs and tables. He has ~ 50,000 to invest and a space
to store at most 35 items. A chair costs him ~ 1,000 and a table costs him ~ 2,000. The trader earns a
profit oft 150 and t 250 on a chair and table, respectively. Formulate the above problem as an LPP
to maximise the profit and solve it graphically.

Ans. \~+ ~e rto.de-r 'bu';& nvN')'oe.l' ~ - ct)o..i'i's - · -- -

'll..
_ _ _ _ _ d -
_ _am - ~t"l'J'oer r;Jl- ~'D\esi _ __ _____ _

- . -----·- --

- - -- - - -- ·- --=- - - - - - ----- -- -
tte. 'na9 on~ ~ 50000 ~ 'mves:K-. _ _ _ __ __ _ ___ _ __
•• ,0001.. + ~COQH ~ "f>OOO)___ __ _ _
, ~t-a¼ ~-!?_Q__ ---- - ~- - - -- - - -- - -
~\~o tie \-IQ.SI o. i~-r~·- s-pcxc.e oP
-
~ o..,._ t"Oo2~
·-
i~ 'i\-e...rng , __
-
j
_ _ __ _ _ ;c ~ ~_t ' _· -- · - -- -· - -- --·. -