LINEAR PROGRAMMING
ASSERTION AND REASONING TYPE QUESTIONS
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.
A. Both A and R are true and R is the correct explanation ofr A
B. Both A and R are true but R is NOT the correct explanation of A
C. A is true but R is false.
D. A is false but R is true.
E. Both A and R are false.
2. Assertion (A): It is necessary to find objective function value at every
point in the feasible region to find optimum value of the objective
function.
Reason(R):For the constrains2x+3y ≤6, 5x+3y≤15, x≥0 and y≥0 cornner
points of the feasible region are (0,2), (0,0) and (3,0).
A. Both A and R are true and R is the correct explanation of A
B. Both A and R are true but R is NOT the correct explanation of A
C. A is true but R is false.
D. A is false but R is true.
E. Both A and R are false.
3. Assertion (A): It is necessary to find objective function value at every
point in the feasible region to find optimum value of the objective
function.
Reason(R):For the constrains2x+3y ≤6, 5x+3y≤15, x≥0 and y≥0 cornner
points of the feasible region are (0,2), (0,0) and (3,0).
A. Both A and R are true and R is the correct explanation of A
B. Both A and R are true but R is NOT the correct explanation of A
C. A is true but R is false.
D. A is false but R is true.
E. Both A and R are false.
4. Assertion (A) : For the constraints of linear optimizing function Z = x1+
x2 given by x1+ x2≤1, 3x1 + x2 ≥1,x≥0 and y≥0 there is no feasible
region.
Reason (R): Z = 7x + y, subject to 5x + y ≤5, x + y ≥3, x 0, y≥ 0.
The corner points of the feasible region are ( , ) (0,3)𝑎𝑛𝑑 (0,5).
1 5
2 2
A. Both A and R are true and R is the correct explanation of A
B. Both A and R are true but R is NOT the correct explanation of A
C. A is true but R is false.
D. A is false but R is true.
E. Both A and R are false.
5. Assertion (A): For the constraints of a LPP problem given by x1 +
2x2≤2000, x1 + x2≤ 1500, x2≤600 and x1, x2≥0 the points (1000, 0), (0, 500), (2,
0) lie in the positive bounded region, but point (2000, 0) does not lie in the
positive bounded region.
Reason (R):
A. Both A and R are true and R is the correct explanation of A
B. Both A and R are true but R is NOT the correct explanation of A
C. A is true but R is false.
D. A is false but R is true.
E. Both A and R are false.
6. Assertion (A):The graph of x≤2 and y≥2 will be situated in the first and
second quadrants.
Reason (R):
A. Both A and R are true and R is the correct explanation of A
B. Both A and R are true but R is NOT the correct explanation of A
C. A is true but R is false.
D. A is false but R is true.
E. Both A and R are false.
7. Assertion (A): The maximum value of Z = 11x+7y
Subject to the constraints are
2x+y≤6,
x≤2,
x,y≥0.
Occurs at the point (0,6).
Reason (R): If the feasible region of the given LPP is bounded, then the
maximum and minimum values of the objective function occurs at corner points.
A. Both A and R are true and R is the correct explanation of A
B. Both A and R are true but R is NOT the correct explanation of A
C. A is true but R is false.
D. A is false but R is true.
E. Both A and R are false.
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.
A. Both A and R are true and R is the correct explanation of A
B. Both A and R are true but R is NOT the correct explanation of A
C. A is true but R is false.
D. A is false but R is true.
E. Both A and R are false.
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.
A. Both A and R are true and R is the correct explanation of A
B. Both A and R are true but R is NOT the correct explanation of A
C. A is true but R is false.
D. A is false but R is true.
E. Both A and R are false.
10. Consider, the graph of constraints stated as linear inequalities as below:
5x+y≤100,
x+y≤60,
x,y≥0.
Assertion (A): (25,40) is an infeasible solution of the problem.
Reason (R):Any point inside the feasible region is called an infeasible
solution.
A. Both A and R are true and R is the correct explanation of A
B. Both A and R are true but R is NOT the correct explanation of A
C. A is true but R is false.
D. A is false but R is true.
E. Both A and R are false.
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.
A. Both A and R are true and R is the correct explanation of A
B. Both A and R are true but R is NOT the correct explanation of A
C. A is true but R is false.
D. A is false but R is true.
E. Both A and R are false.
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.
A. Both A and R are true and R is the correct explanation ofr A
B. Both A and R are true but R is NOT the correct explanation of A
C. A is true but R is false.
D. A is false but R is true.
E. Both A and R are false.
13.Assertion (A): For the LPP Z= 3x+2y, subject to the constraints
x+2y≤2; x≥0; y≥ 0 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.
A. Both A and R are true and R is the correct explanation of A
B. Both A and R are true but R is NOT the correct explanation of A
C. A is true but R is false.
D. A is false but R is true.
E. Both A and R are false.
14. Assertion (A):The linear programming problem, maximize Z = x+2y
subject to constraints x-y≤10,2x + 3y≤20 and x≥0; y≥ 0. It gives the maximum
value of Z as 40/3.
Reason (R):To obtain maximum value of Z, we need to compare value of Z at
all the corner points of the shaded region.
A. Both A and R are true and R is the correct explanation of A
B. Both A and R are true but R is NOT the correct explanation of A
C. A is true but R is false.
D. A is false but R is true.
E. Both A and R are false.
15.Assertion (A):Consider the linear programming problem. Maximise
Z=4x+y Subject to constraints x+ y≤50; x+ y≥100 and x, y ≥0. Then,
maximum value of Z is 50.
Reason (R):If the shaded region is bounded then maximum value of objective
function can be determined.
A. Both A and R are true and R is the correct explanation of A
B. Both A and R are true but R is NOT the correct explanation of A
C. A is true but R is false.
D. A is false but R is true.
E. Both A and R are false.
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
