COrner

maximum/minimUm if the opeti ined by

points.
in steo 2 is the maúmum + by < M has no pointtin
values a
commn
minimum value feasible region, otherwise
with

minimum value.

2. Evaluate
objective then M, say is
unbounded,
function Z = +
ax by at 4. When the region
is

Zi the open hatf

plane determined
by

maimum value with the feasible

of
each cormer point. common
ax +by > M has no point maimum
in

Zhas no
value.

region,
otherwise

function for a given

3. The objective linear
prog
Z = ar + by -5.If;
COMPETENCY FOCUsSED QUESTIONS mming problem

is
value at (1, 2) and (3, 1).
then
same [Levd-
Mca MULTIPLE CHOICE 1 Mark (a) a+ 26 =0 (b) a+ b= 0

QUESTIONS
(c) a =b (d) 2a -b=0
which group of
constraints
1. Of the following, 4. For a given LPP, corner points of a
closed
below?
the feasible region given are A3, 5), B(4. 2), C(3,0)
represents 2024] feasible region 2
[Level- I]|CBSE function,
O(0, 0), then objective

attains maximum at
[Level -
(a) A (b) B (c) Cor 0
(à It depends upon values of p and g znd

points 4,B, C.
T 5.The restrictions imposed on decision variabls

x+2y =76 involved in an

are called:
objective function of a linezr

programming problem
[Level - II [CBSE2124

(a) feasible solutions

2x +y=
y=
(b) constraints

(c) optimal solutions

104 ()infeasible solutions

x+2y s 76, 2r+y> 104, x, >0

(a) y
cONSTRUCTED RESPONSE
(b) x+2y s 76, 2+ys 104, x, y > 0
TYPE QUESTIONS
(c) x+2y > 76,2x +ys 104, x, y >0
x+ 2y > 0 VERY SHORT ANSWER
(d)

2. The solution set

76, 2xty>
of
104,

the inequation
x, y

3x+ 2y >3is
>

VSA TYPE QUESTIONS 2 Marts

|Level - IJ|CBSEAdditional Practice Question 2023]

regt
6. Ifthe cornerpoints of a bounded
feasible

(a) half plane containing the origin

C(30,
(b) half plane not containing the origin of a LPP are A(0, 50). B(20, 40), I005

Z =x*
3x+ 2y =3 function is
(c) the point being on the line D0, 200)and the objectíve
then find the maximum value of Z.
(d) None of these
 Linear Programming
109
7. The corner points of the feasible region determined
12. Solve the following Linear Programming
by thesystem of lincar constraints
are (0, 3),
Problem
(1, ).(3, 0). Let Z=px+ qy be the objective
graphically:

Minimise Z=3x+ 5y such that x + 3y 2>3, for more

function, when p, q>0.Find the relation between
Questions

D and g if Z is minimum at (3, 0) and (1, 1). xty > 2, x, y > 0 [NCERT]

Check whether the points (3, 2) and

LONG ANSWER
8.
(1. ) lie in the half plane
LA
TYPE QUESTIONS 5 Marks
2r+y-4<0. formore
Questions 13. Solve the following problem graphically:

Minimise and Maximise Z =3x + 9y

SHORT ANSWER
SA TYPE QUESTIONS 3 Marks
subject to the constraints:

x+ 3y < 60
9, Solve the following LPP graphically
x+ y 10
Maximise Z = 10x+ 15y
xSy
subject to the constraints 3r + 2y s 50
x>0, y > 0 [NCERT]
xt 4y 20
14. Show that the minimum of Z occurs at more than
x 8, y 0 |CBSE 2023(C)]
two points. Minimise and Maximise Z =x + 2y
10. Maximise Z =&r+9y subject to the constraints:
subject to the constraints
2x + 3y S 6; 3x -2y s 6; y sl; x, y 0
11. Solve the following linear programming problem
x+ 2y > 100,

graphically: |CBSE 2024] 2r-y s 0, 2x +ys 200; x, y >0.

Maximise z=4x + 3y, 15. Minimise and Maximise z =5x + 2y subject to

subject to the constraints the following constraints:

xtys800 x-2y s 2 3x + 2y s 12

2r ty 1000 -3x + 2y <3 x>0, y >0

for more
XS 400 |Panchkula 2015] (5 Marks) Questions

COMPETENCY FOCUSSED QUESTIONS

AR ASSERTION AND REASON QUESTIONS
Assertion (4): Constraints are inequations.
1.
a statement of assertion
In the following questions,
(R): Linear inequalities related to
(A) is followed by a statement of reason (R). Chose Reason
variables involved, are known as constraints.

he correct answer out of the following choices.

of all the given
R is the 2. Assertion (4): Common solution
are true and correct
(a) Both A and R

constraints in LPP, is known as feasible region.

explanation of A.
not the correct Reason (R): A linear function Z=ax + by, which
(0) BothAand R are true but R is
is known as
be maximized or minimized
has to
explanation of A.
function.
an objective
(c) A is true but R is false.

(a) A is false but R istrue.

for more
Questions
110 7ogether witk Phygital Mathematics--12

INTEGRATED QUESTIONS
CBQ CASE-BASED/SOURCE-BASED
lots of work and calculations are
for its implementation and based on
required as
are taken up daily,
1. Different activities
some manufacturing activity information
within limitations.
A company is planning: to manufacturing
we work
for some variables x and y related
activity.
data is obtained
available, the following
DAILY ROUTINES

.).,

get dressed brush your teeth

wake up

have breakfast goto school

take a shower

do your
bed homework
eat dinner go to

Z=2x +3y
x>0, y 0
x+ 2y < 40

2x +y < 50

Based on above information answer the following questions:

(i) Find the maximum value of Z.

(ii) Find the relation between p and g if the objective function Z =px + gy, where p, g>0 attains equal

values at (3, 4) and (2, 7).

(iii) Check whether the ordered pair (12, 27) lies inthe graphical solution of 2xtys50.
OR

Check whether the ordered pair (20, 10) lies in the graphical solution of 2x -y 2 50. for more
Questions

Hints & Solutions to all the questions are given at the end
of all the chapters
 Note: For Assertion andReasonchoices, refer to the text.

1. The coner points ofthe bounded feasible region 8. Solve the following LPP graphically:
of an LPP are O(0,0), A(250, 0), B(200, 50)and Minimise Z = 5r + 3v
Co,175). If the maximum value of the objective Subject to the constraints
function Z=
2ax + by occurs at the points
2r +y 10
A(250,0) and B(200, 50),then the relation between
a and b is:

AS 10
(a) 2a =b (b)2a =3b
(c) a=b (d) a =2b
2.The point which lies in the half-plane 2r +y-4s0 X, y 0
points of a closed
is:
9. For a given LPP, corner
(a) (0, 8) (b) (1, 1) feasible region are O0, 0),P(200, 0). Q(80, 120),
(c) (5, 5) (d) (2, 2) R(0, 180). If Z = 525x + 675y is the objective

function, then find the maximum value of Z.

3. A Linear Programming Problem is as follows:

Minimise =
Z 2x +y 10. The corner points thefeasible region determined

of
subject to the constraints by following system of linear inequations:

0 2x +y s10, x 3y 15, x, y+ s
0 are (0, 0),
x3,x s9, y >
IfZ=px t qy, where
x-y > 0, x +ys 14 (5, 0), (3, 4) and (0, 5).

The feasible region has P, q >0

be the objective function, then find the

(a) 5 corner condition on p and q so that attains same value Z

points including (0, 0) and (9, 5)
at both (3, 4) and (0, 5).
(b) 5 corner points including (7, 7) and (3, 3)
11. For an LPP, the objective function is Z =2.50x
(c) 5 corner points including (14, 0) and (9, 0)
+y and the feasible region determined by a set
(d) 5 corner points including (3, 6) ,and (9,5) of constraints is shown in the graph.
4. Assertion (4): The maximum value of Z=7x+2y
subject to constraints 2x+y s6,xS 2, x>0,y >0
occurs at corner point (0, 6).

Reason (R): If the feasible region of an LPP is

bounded, then minimum and maximum values of

the objective function occurs at corner points. (0, 12)
5. Assertion (4):The point (1, 2) lies in the half
2x ty<5.
plane
P
(0, 4)\ Q
Reason (R): If a point (x;, y;) satisfies the given 3,3)
inequality, then the point lies in the half plane
represented by the given inequality. X
R(4, 0) 12,. 0
6. Solve the following LPP graphically:
Maximise Z =6x + 7y Based on above answer the following:
Subject to the constraints () Find the constraintrelated to points P and S.

3x +5y s 15 (i) Find the constraint related to points Q and R.

5x + 2y s 10 (iii) Find the maximum value of Z.

OR
(i) Check whether the ordered pair (1, 1) lies
1.Solve the following Linear ProgrammingProblem
graphically:
in thegraphical solution of x+3y < 12.

Maximise: P= 70x +40y

subject to: 3x +2y s9,
3x tys9,

x0, 20 y
SCAN ME
for Solutions