CLASS 12 WEEKLY SCHEDULE
WEEK 43
DATE & TIME SESSION
25 OCT - 2021 CBSE TERM 1 - 20 MOST IMPORTANT
MON 08:00 PM QUESTION MATHS MCQs
26 OCT - 2021 Think Hatke IOQM Booster -
TUE 07:00 PM Toughest PYQs - 1
26 OCT - 2021 LINEAR PROGRAMMING |
TUE 08:00 PM ONE SHOT
27 OCT - 2021 Think Hatke IOQM Booster -
WED 07:00 PM Toughest PYQs - 2
28 OCT - 2021 Think Hatke IOQM Booster -
THU 07:00 PM Toughest PYQs - 3
30 OCT - 2021 Think Hatke IOQM Booster -
SAT 08:00 PM Toughest PYQs - 4
CBSE 12
Linear Programming
Syllabus for Term - 1 2021-22
Introduction, related terminology such as
constraints, objective function,
optimization, different types of linear
programming (L.P.) problems. Graphical
method of solution for problems in two
variables, feasible and infeasible regions
(bounded), feasible and infeasible
solutions, optimal feasible solutions (up to
three non-trivial constraints).
Introduction
With the help of linear programming
models, a decision maker can most
efficiently and effectively employ his
production factor and limited resources to
get maximum profit at minimum cost. He
can also take quick decisions which are
important in modern times because any
delay or postponement in it may give
advantage to other organizations.
Linear programming :
Linear programming is a method of
determining a particular programme or
plan of action to optimize (maximize or
minimize).
Introduction
Linear programming problem (L.P.P.) :
lt is a problem of finding optimal
(maximum or minimum) value of a linear
function subject to certain restrictions
(constraints) determined by a set of linear
inequations with variables as non-
negative.
General form of L.P.P.
The general form of a linear programming
problem is Optimize (Maximize or
Minimize) Z = c1x1 + c2x2 + ………… + cnxn
Subject to
a11x1 + a12x2 + …… + a1nxn (≤, = ,≥)b1
a21x1 + a22x2 + ….. + a2nxn (≤, = ,≥)b2 …(1)
⋮ ⋮ ⋮
⋮
am1x1 + am2x2 + …. + amnxn (≤, = ,≥)bm
x1, x2, …………, xn ≥ 0 …(2)
Important Definitions
The definitions of various terms related to
the LPP are as follows:
(a) Objective Function: The linear
function Z which is to be maximized
or minimized is the objective
function of the LPP.
(b) Decision Variables: x1, x2…….., xn are
the decision variables.
(c) Constraints: The inequations or
equations (1) in the variables of a LPP
which describe the conditions under
which the optimization
(maximization or minimization) is to
be accomplished are called
constraints.
Important Definitions
In the constraints given in the general
form of LPP there may be any one of the
three signs ≤, = ,≥.
(d) Non-negativity Restrictions: There are
the constraints (2) which describe that the
variables involved in a LPP are non-
negative.
(e) Feasible region: The common region
determined by all the constraints
including non-negative constraints of a
LPP is called the feasible region or
solution region.
A feasible region may be (i) bounded (ii)
unbounded.
Important Definitions
Bounded feasible region:
Constraints are:
x + 3y ≤ 12
3x + y ≤ 12
x ≥ 0, y ≥ 0
(f) Corner points of a feasible region:
Corner points of a feasible region are
points of intersection of two boundary
Working rule to Solve LPP
Graphically (Corner Point
Method)
(a) Formulate the given linear
programming problem.
(a) Convert the linear constraints into
equalities and then draw their graphs
which will be straight lines.
(a) Find the feasible region of the linear
programming problem and
determine its corner points by
solving the equations of lines taken
two at a time.
Working rule to Solve LPP
Graphically (Corner Point
Method)
(d) Determine the value of the objective
function Z at each corner point. Also, find
the least value m and greatest value M of
the values of objective function at corner
points.
(e) If the feasible region R is bounded,
then M and m will be the maximum and
minimum values of Z, respectively .
HPMPRO
QUESTION
Q1. Based on the given shaded region as
the feasible region in the graph, at which
point(s) is the objective function Z = 3x +
9y maximum?
CBSE Sample Paper 2021-22 1 Mark
A Point B
B Point C
C Point D
D Every point on the line
segment CD
Q1. Based on the given shaded region as
the feasible region in the graph, at which
point(s) is the objective function Z = 3x +
9y maximum?
Q1. Based on the given shaded region as
the feasible region in the graph, at which
point(s) is the objective function Z = 3x +
9y maximum?
SOLUTION
Z is maximum 180 at points C(15, 15) and
D(0, 20).
⇒ Z is maximum at every point on the line
segment CD.
ANSWER
Q1. Based on the given shaded region as
the feasible region in the graph, at which
point(s) is the objective function Z = 3x +
9y maximum?
CBSE Sample Paper 2021-22 1 Mark
A Point B
B Point C
C Point D
D Every point on the line
segment CD
QUESTION
Q2. In the given graph, the feasible
region for a LPP is shaded. The objective
function Z = 2x - 3y, will be minimum at
:
CBSE Sample Paper 2021-22 1 Mark
A (4, 10)
B (6, 8)
C (0, 8)
D (6, 5)
Q2. In the given graph, the feasible
region for a LPP is shaded. The objective
function Z = 2x - 3y, will be minimum at
:
Q2. In the given graph, the feasible
region for a LPP is shaded. The objective
function Z = 2x - 3y, will be minimum at
:
SOLUTION
Z is minimum -24 at (0, 8)
ANSWER
Q2. In the given graph, the feasible
region for a LPP is shaded. The objective
function Z = 2x - 3y, will be minimum at
:
CBSE Sample Paper 2021-22 1 Mark
A (4, 10)
B (6, 8)
C (0, 8)
D (6, 5)
QUESTION Q3. For an objective function Z = ax + by,
where a, b > 0; the corner points of the
feasible region determined by a set of
constraints (linear inequalities) are (0,
20), (10, 10), (30, 30) and (0. 40). The
condition on a and b such that the
maximum Z occurs at both the points
(30, 30) and (0, 40) is:
CBSE Sample Paper 2021-22 1 Mark
A b - 3a = 0
B a = 3b
C a + 2b = 0
D 2a - b = 0
Q3. For an objective function Z = ax + by,
where a, b > 0; the corner points of the
feasible region determined by a set of
constraints (linear inequalities) are (0,
20), (10, 10), (30, 30) and (0. 40). The
condition on a and b such that the
maximum Z occurs at both the points
(30, 30) and (0, 40) is:
Q3. For an objective function Z = ax + by,
where a, b > 0; the corner points of the
feasible region determined by a set of
constraints (linear inequalities) are (0,
20), (10, 10), (30, 30) and (0. 40). The
condition on a and b such that the
maximum Z occurs at both the points
(30, 30) and (0, 40) is:
SOLUTION
As Z is maximum at (30, 30) and (0, 40)
⇒ 30a + 30b = 40b ⇒ b - 3a = 0
ANSWER Q3. For an objective function Z = ax + by,
where a, b > 0; the corner points of the
feasible region determined by a set of
constraints (linear inequalities) are (0,
20), (10, 10), (30, 30) and (0. 40). The
condition on a and b such that the
maximum Z occurs at both the points
(30, 30) and (0, 40) is:
CBSE Sample Paper 2021-22 1 Mark
A b - 3a = 0
B a = 3b
C a + 2b = 0
D 2a - b = 0
QUESTION
Q4. The corner points of the feasible
region of an LPP are (0, 0), (0, 8), (2, 7),
(5, 4) and (6, 0). The maximum profit P
= 3x + 2y occurs at the point …
CBSE 2020 1 Mark
A (0, 8)
B (2, 7)
C (5, 4)
D (6, 0)
Q4. The corner points of the feasible
region of an LPP are (0, 0), (0, 8), (2, 7),
(5, 4) and (6, 0). The maximum profit P
= 3x + 2y occurs at the point ………… .
Q4. The corner points of the feasible
region of an LPP are (0, 0), (0, 8), (2, 7),
(5, 4) and (6, 0). The maximum profit P
= 3x + 2y occurs at the point ………… .
SOLUTION
Given that corner points are (0, 0), (0, 8),
(2, 7), (5, 4) and (6, 0) and P = 3x + 2y
at (0, 8), P = 16, at (5, 4), P = 23
at (2, 7), P = 20, at (6, 0), P = 18,
at (0, 0), P = 0
Pmax = 23 at (5, 4)
ANSWER
Q4. The corner points of the feasible
region of an LPP are (0, 0), (0, 8), (2, 7),
(5, 4) and (6, 0). The maximum profit P
= 3x + 2y occurs at the point ………… .
CBSE 2020 1 Mark
A (0, 8)
B (2, 7)
C (5, 4)
D (6, 0)
QUESTION
Q5. What is the maximum value of Z = 3x
+ 4y, if the feasible region (shaded) for a
LPP is shown in following figure.
A 0
B 152
C 156
D 196
Q5. What is the maximum value of Z = 3x
+ 4y, if the feasible region (shaded) for a
LPP is shown in following figure.
Q5. What is the maximum value of Z = 3x
+ 4y, if the feasible region (shaded) for a
LPP is shown in following figure.
Q5. What is the maximum value of Z = 3x
+ 4y, if the feasible region (shaded) for a
LPP is shown in following figure.
SOLUTION
As clear from the graph, corner points are O,
A, E and D with coordinates (0, 0), (52, 0),
(44, 16) and (0, 38), respectively. Also, given
region is bounded.
Here, Z = 3x + 4y
∵ 2x + y = 104 and 2x + 4y = 152
⇒ -3y = -48
⇒ y = 16 and x = 44
Corner Points Corresponding value of
Z
(0, 0) 0
(52, 0) 156
(44, 16) 196→ Maximum
(0, 38) 152
Hence, Z at (44, 16) is maximum and its
maximum value is 196.
ANSWER
Q5. What is the maximum value of Z = 3x
+ 4y, if the feasible region (shaded) for a
LPP is shown in following figure.
A 0
B 152
C 156
D 196
Case Study
Suppose a dealer in rural area wishes to
purchase a number of sewing machines.
He has only ₹5760 to invest and has space
for at most 20 items for storage. An
electronic sewing machine costs him ₹360
and a manually operated sewing machine
₹240. He can sell an electronic sewing
machine at a profit of ₹22 and a manually
operated sewing machine at a profit of
₹18.
Based on the above information, answer
the following questions.
QUESTION
Q6. Let x and y denotes the number of
electronic sewing machines and
manually operated sewing machines
purchased by the dealer. If it is assume
that the dealer purchased at least one of
the the given machines, then
A x+y≥0
B x+y<0
C x+y>0
D x+y≤0
SOLUTION
Ans: (C)
ANSWER
Q6. Let x and y denotes the number of
electronic sewing machines and
manually operated sewing machines
purchased by the dealer. If it is assume
that the dealer purchased at least one of
the the given machines, then
A x+y≥0
B x+y<0
C x+y>0
D x+y≤0
QUESTION
Q7. Let the constraints in the given
problem is represented by the following
inequalities.
x + y ≤ 20
360x + 240y ≤ 5760
x, y ≥ 0
Then which of the following point lie in
its feasible region.
A (0, 24)
B (8, 12)
C (20, 2)
D None of these
Q7. Let the constraints in the given
problem is represented by the following
inequalities.
x + y ≤ 20
360x + 240y ≤ 5760
x, y ≥ 0
Then which of the following point lie in
its feasible region.
Q7. Let the constraints in the given
problem is represented by the following
inequalities.
x + y ≤ 20
360x + 240y ≤ 5760
x, y ≥ 0
Then which of the following point lie in
its feasible region.
SOLUTION
Since (8, 12) satisfy all the inequalities
therefore (8, 12) is the point in its feasible
region.
ANSWER
Q7. Let the constraints in the given
problem is represented by the following
inequalities.
x + y ≤ 20
360x + 240y ≤ 5760
x, y ≥ 0
Then which of the following point lie in
its feasible region.
A (0, 24)
B (8, 12)
C (20, 2)
D None of these
QUESTION
Q8. If the objective function of the given
problem is maximise z = 22x + 18y, then
its optimal value occur at
A (0, 0)
B (16, 0)
C (8, 12)
D (0, 20)
Q8. If the objective function of the given
problem is maximise z = 22x + 18y, then
its optimal value occur at
Q8. If the objective function of the given
problem is maximise z = 22x + 18y, then
its optimal value occur at
SOLUTION
At (0, 0), z = 0
At (16, 0), z = 352
At (8, 12), z = 392
At (0, 20), z = 360
It can be observed that max z occur at (8,
12). Thus, z will attain its optimal value at
(8, 12).
ANSWER
Q8. If the objective function of the given
problem is maximise z = 22x + 18y, then
its optimal value occur at
A (0, 0)
B (16, 0)
C (8, 12)
D (0, 20)
QUESTION Q9. Suppose the following shaded region
APDO, represent the feasible region
corresponding to mathematical
formulation of given problem. Then
which of the following represent the
coordinates of one of its corner points.
A (0, 24)
B (12, 8)
C (8, 12)
D (6, 14)
Q9. Suppose the following shaded region
APDO, represent the feasible region
corresponding to mathematical
formulation of given problem. Then
which of the following represent the
coordinates of one of its corner points.
Q9. Suppose the following shaded region
APDO, represent the feasible region
corresponding to mathematical
formulation of given problem. Then
which of the following represent the
coordinates of one of its corner points.
Q9. Suppose the following shaded region
APDO, represent the feasible region
corresponding to mathematical
formulation of given problem. Then
which of the following represent the
coordinates of one of its corner points.
SOLUTION
We have, x + y = 20 ...(i)
and 3x + 2y = 48 ...(ii)
On solving (i) and (ii),
we get x= 8,y= 12.
Thus, the coordinates of P are (8, 12) and
hence (8, 12) is one of its corner points.
ANSWER Q9. Suppose the following shaded region
APDO, represent the feasible region
corresponding to mathematical
formulation of given problem. Then
which of the following represent the
coordinates of one of its corner points.
A (0, 24)
B (12, 8)
C (8, 12)
D (6, 14)
QUESTION
Q10. If an LPP admits optimal solution at
two consecutive vertices of a feasible
region, then
A the required optimal solution is at the
midpoint of the line joining two points
the optimal solution occurs at every
B point on the line joining these two
points.
C the LPP under consideration is not
solvable
D the LPP under consideration must be
reconstructed
SOLUTION
The optimal solution occurs at every point
on the line joining these two points.
ANSWER
Q10. If an LPP admits optimal solution at
two consecutive vertices of a feasible
region, then
A the required optimal solution is at the
midpoint of the line joining two points
the optimal solution occurs at every
B point on the line joining these two
points.
C the LPP under consideration is not
solvable
D the LPP under consideration must be
reconstructed
8th Jan 2020-(Shift 1)
Reach out to me at
connectharshpriyam@vedantu.com
