12XM ARMCQ - Linear Programming CBSE
12XM ARMCQ - Linear Programming CBSE
12XM ARMCQ - Linear Programming CBSE
Scroll Down
1. Assertion (A): Feasible region is the set of points which satisfy all of
the given constraints.
Reason (R): The optimal value of the objective function is attained at the
points on X-axisonly.
8. Assertion (A):If an LPP attains its maximum value at two corner points of
the feasible region then it attains maximum value at infinitely many points.
Reason (R): if the value of the objective function of a LPP is same at two
corners then it is same at every point on the line joining two corner points.
Assertion (A): The points (10,50), (0,60) , (10,10) and (20,0) are feasible
solutions.
Reason (R): Points within and on the boundary of the feasible region
represent feasible solutions of the constraints.
11. Assertion (A): The region represented by the set {(x,y): 4 x2+y2 9} is a
convex set.
Reason (R): The set {(x,y): 4 x2+y2 9} represents the region between two
concentric circles of radii 2 and 3.
12. Assertion (A):For an objective function Z= 15x + 20y, corner points are
(0,0), (10,0), (0,15) and (5,5). Then optimal values are 300 and 0
respectively.
Reason (R):The maximum or minimum value of an objective function is known
as optimal value of LPP. These values are obtained at corner points.
13. Assertion (A): For the LPP Z= 3x+2y, subject to the constraints
x+2y 2; x 0; y both maximum value of Z and Minimum value of Z can
be obtained.
Reason (R):If the feasible region is bounded then both maximum and
minimum values of Z exists.
ANSWERS:
ASSERTION AND REASONING
1 C 2 D 3 D 4 A 5 A
6 A 7 A 8 A 9 A 10 C
11 D 12 A 13 A 14 A 15 D