Scribd
Upload
136 views4 pages

Class 12 LPP MCQs and Assertions

The document contains multiple choice questions and assertions related to calculus and linear programming, including concepts of maxima, minima, objective functions, and feasible regions. It also includes case study questions about maximizing profits in manufacturing and airline ticket sales. Each question is followed by possible answers, indicating the correct choices for various mathematical scenarios.

Uploaded by

itsmeseat
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
136 views4 pages

Class 12 LPP MCQs and Assertions

The document contains multiple choice questions and assertions related to calculus and linear programming, including concepts of maxima, minima, objective functions, and feasible regions. It also includes case study questions about maximizing profits in manufacturing and airline ticket sales. Each question is followed by possible answers, indicating the correct choices for various mathematical scenarios.

Uploaded by

itsmeseat
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

13.

Assertion (A): x = 0 is the point of local maxima of the function f given by 𝒇 =


𝟑𝒙𝟒 + 𝟒𝒙𝟑 − 𝟏𝟐𝒙𝟐 +12
Reason(R): 𝒇′(𝒙) = 𝟎 𝒂𝒕 𝒙 = 𝟎 𝒂𝒏𝒅 𝒂𝒍𝒔𝒐 𝒇′′(𝒙) < 0 𝑎𝑡 𝑥 = 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 the correct explanation of A
C. A is true but R is false
D. A is false but R is true

[Link] (A): Maximum value of the function f(x) =(𝟐𝒙 − 𝟏)𝟐 + 𝟑 is 3.


Reason(R): f(x)≥ 𝟑 for all real values of x.
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 the correct explanation of A
C. A is true but R is false
D. A is false but R is true
15. Assertion f(x) = 𝒆𝒙 do not have maxima and minima
Reason ( R) : f ’(x) =𝒆𝒙 ≠ 𝟎 for all real values of x.
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 the correct explanation of A
C. A is true but R is false
D. A is false but R is true

LINEAR PROGRAMMING

MULTIPLE CHOICE QUESTIONS

1. A Linear function, which is minimized or maximized is called


(a) an objective function (b) an optimal function
(c) A feasible function (d) None of these
2. The maximum value of Z = 3x + 4y subject to the constraints :
x+ y ≤ 4, x ≥ 0 , y ≥ 0 is :
(a) 0 (b) 12 (c) 16 (d) 18
3. The maximum value of Z = 2x +3y subject to the constraints :
𝑥 + 𝑦 ≤ 1 , 3𝑥 + 𝑦 ≤ 4 , 𝑥, 𝑦 ≥ 0is
(a) 2 (b) 4 (c) 5 (d) 3
4 The point in the half plane 2𝑥 + 3𝑦 − 12 ≥ 0 is :
(a) (- 7,8 ) (b) ( 7 , - 8 ) (c) ( -7 , - 8 ) (d) (7, 8 )
5. Any feasible solution which maximizes or minimizes the objective
function is Called:
(a) A regional feasible solution (b)An optimal feasible solution
(c)An objective feasible solution (d) None of these
6. The solution set of the in equation 2𝑥 + 𝑦 > 5 is
(a) Half plane that contains the origin

48
(b) Open half plane not containing the origin
(c) Whole 𝑥𝑦 −plane except the points lying on the line 2𝑥 + 𝑦 = 5
(d) None of these
7. Objective function of a LPP is
(a) a constraint (b) a function to be optimized
(c)a relation between the variables (d) none of these
8. The maximum value of 𝑍 = 4𝑥 + 2𝑦 subjected to the
Constraints2𝑥 + 3𝑦 ≤ 18 ,𝑥 + 𝑦 ≥ 10 ;𝑥, 𝑦 ≥ 0 is
(a) 320 (b) 300 (c) 230 (d) none of these
[Link] optimal value of the objective function is attained at the points :
(a) Given the intersection of inequations with the axes only
(b) Given by intersection of inequations with X-axis only
(c) Given by corner points of the feasible region
(d) None of these.
10. If the constraints in a linear programming problem are changed :
(a) The problem is to be re-evaluated
(b) Solution is not defined
(c) The objective function has to be modified
(d) The change in constraints is ignored
11. Which of the following statements is correct?
(a) Every L P P admits an optimal solution
(b)A L P P admits unique optimal solution
(c) If a L P P admits two optimal solution solutions, it has aninfinite number of optimal solutions
(d) The set of all feasible solutions of a LPP is a finite set.
[Link] feasible solution of a LPP belongs to
(a) First and second quadrants (b) First and third quadrants.
(c) Second quadrant (d) Only first quadrant.
[Link] value of objective function is maximum under linear constraints
(a) At the centre of feasible region
(b) At (0,0)
(c) At any vertex of feasible region
(d)The vertex which is at maximum distance from (0,0)
14. Which of the term is not used in a linear programming problem :
(a) Slack inequation (b) Objective function
(c) Concave region (d) Feasible Region
15. A linear programming of linear functions deals with :
(a) Minimizing (b) Optimizing (c) Maximizing (d) None
16. By graphical method, the solution of linear programming problem
Maximize : Z= 3x + 5y
Subject to : 3x +2y ≤ 18 , x ≤ 4, y ≤ 6 and x, y ≥ 0 ,is
(a) x = 2 ,y = 0 ,Z = 6 (b) x = 2 , y = 6, z=36
(c) x=4, y = 3 , Z= 27 (d) X = 4, y = 6,Z = 42
17. Maximum value of the objective function 𝑍 = 4𝑥 + 3𝑦 subject to the constraints
3𝑥 + 2𝑦 ≤ 160, 5𝑥 + 2𝑦 ≥ 200, 𝑥 + 2𝑦 ≥ 80 , 𝑥, 𝑦 ≥ 0 is
(a) 320 (b) 300 (c) 230 (d) none of these
18. The point at which the maximum value of 𝑥 + 𝑦 , subject to the
Constraints 𝑥 + 2𝑦 ≤ 70 , 2𝑥 + 𝑦 ≤ 95 , 𝑥, 𝑦 ≥ 0is obtained, is
(a) (30, 25) (b) (20, 35 ) (c ) (35 ,20 ) (d) (40 , 15)

49
[Link] corner points of the feasible region determined by the following
System Of linear inequalities: 2𝑥 + 𝑦 ≤ 10 , 𝑥 + 3𝑦 ≤ 15 ,
𝑥, 𝑦 ≥ 0 are (0,0),(5,0), (3,4) and (0, 5 ) .
Let 𝑍 = 𝑝𝑥 + 𝑞𝑦, where 𝑝 , 𝑞 > [Link] on 𝑝 and 𝑞so that the
maximum of 𝑍 occurs at both ( 3, 4 ) and ( 0, 5) is
(a) 𝑝 = 𝑞 (b) 𝑝 = 2𝑞 (c) 𝑝 = 3𝑞 (d) 𝑞 = 3𝑝
20. Solution set of inequations 𝑥 − 2𝑦 ≥ 0, 2𝑥 − 𝑦 ≤ −2 , 𝑥 ≥ 0, 𝑦 ≥ 0 is
(a) First quadrant (b) infinite
(c )Empty (d) closed half plane
CASE STUDY QUESTIONS
I. A small firm manufacturers gold rings and chains. The total number of rings and chains manufactured
per day is atmost 24 . it takes 1 hour to make ring and 30 minutes to make a chain . The maximum number of
hours available per day is 16 . If the profit on a ring is Rs.300 and that on a chain is Rs.190 . Firm is concerned
about earning maximum profit on the number of rings(𝑥) and chains(𝑦) that have to be manufactured per
day .
Using the above information give the answer of the following questions.

(i) The objective function is


(a) 190𝑥 + 300𝑦 (b) 300𝑥 + 190𝑦 (c) 𝑥 + 𝑦 (d) none of the above
(ii) For maximum profit firm has to make the number of rings and chains –
(a) 0,24 (b) 8,16 (c) 16,8 (d) 16,0
(ii) Corner points of feasible region are
(a) (0,24) (b) (8,16) (c) a &b both (d) (12,0)
(iv) Maximum profit earned by the firm is equal to
(a) 6440 (b) 4560 (c) 5000 (d) 5440
(v) Constraints of the above LPP are
(a) 𝑥 ≤ 0 (b) 2𝑥 + 𝑦 ≤ 32 (c) 𝑦 ≥ 1 (d) none of the above

II. A company started airlines business and for running business it bought aeroplanes . Now an aeroplane can carry
maximum of 200 passengers . A profit of Rs.400 is made on each first class ticket and a profit of Rs.300 is made on each
second class ticket . The airline reserves at least 20 seats for first class .However , at least four times as many passengers
prefer to travel by second class then by first class . Company wants to make maximum profit by selling tickets of first
class (𝑥) and second class (𝑦) .
Using the above information give the answer of the following questions.

(i) To get maximum profit how many first class tickets should be sold –
(a) 20 (b) 180 (c) 160 (d) 40
(ii) Difference between the maximum profit and minimum profit is equal to
(a) 8000 (b) 56000 (c) 64000 (d) none of the above
(iii) Corner points of feasible region are
(a) (20,180) (b) (20,0) (c) (40,0) (d) all the above
(iv) Minimum profit is equal to
(a) 8000 (b) 6000 (c) 64000 (d) none of the above
(v) The objective function is
(a) 400𝑥 + 300𝑦 (b) 300𝑥 + 400𝑦 (c) 𝑥 + 𝑦 (d) none of the above

ASSERTION AND REASON


Directions (Q. Nos. 1-5) Each of these questions contains two statements: Assertion (A) and Reason (R). Each of these
questions also has four alternative choices, any one of which is the correct answer. You have to select one of the codes
(a), (b). (c) and (d) given below.
(a) A is true, R is true: R is a correct explanation for A.

50
(b) A is true, R is true; R is not a correct explanation for A.
(c) A is true: R is false.
(d) A is false: R is true.
1. Assertion (A) Maximum value of 𝑍 = 11𝑥 + 7𝑦 , subject to constraints 2𝑥 + 𝑦 ≤ 6, 𝑥 ≤ 2 , 𝑥 ≥ 0 , 𝑦 ≥ 0 will be
obtained at (0,6) .
Reason (R)In a bounded feasible region, it always exist a maximum and minimum value.
2. Assertion (A)The linear programming problem, maximize 𝑍 = 2𝑥 + 3𝑦
subject to constraints 𝑥 + 𝑦 ≤ 4 , 𝑥 ≥ 0 , 𝑦 ≥ 0
It gives the maximum value of Z as 8 .
Reason (R)To obtain maximum value of Z, we need to compare value of Z at all the corner points of the feasible region .
3. Assertion (A) For an objective function 𝑍 = 4𝑥 + 3𝑦 , corner points are (0,0), (25,0) , (16,16) and (0,24) . Then
optimal values are 112 and 0 respectively .
Reason (R) Themaximum or minimum values of an objective function is known as optimal value of LPP . These values
are obtained at corner points .
4. Assertion (A) Objective function 𝑍 = 13𝑥 − 15𝑦 , is minimized subject to constraints 𝑥 + 𝑦 ≤ 7 , 2𝑥 − 3𝑦 + 6 ≥
0 , 𝑥 ≥ 0 , 𝑦 ≥ 0 occur at corner point (0,2) .
Reason (R) If the feasible region of the given LPP is bounded , then the maximum or minimum values of an objective
function occur at corner points .
5. Assertion (A) Maximise𝑍 = 3𝑥 + 4𝑦, subject to constraints : 𝑥 + 𝑦 ≤ 1 ,, 𝑥 ≥ 0 , 𝑦 ≥ 0 .
Then maximum value of Z is 4 .
Reason (R) If the shaded region is not bounded then maximum value cannot be determined.

ANSWERS
RELATIONS AND FUNCTIONS
ANSWERS OF MCQ

1- Answer: (a) Reflexive


2- Answer: (a) f is one-one onto

3- Answer: (c) {0,3,4,5,-3,-4,-5}

4- Answer: (d) (8,10) € R

5- Answer: (c) 24

6- Answer: (c) R is symmetric


7- Answer: (a) f is one-one and onto
8- Answer: (a) Ax B

9- Answer: (c) equivalence


10- Answer: (d) 5
11- Answer: (b) reflexive, transitive but not symmetric
12- Answer: (a) reflexive but not symmetric
13- Answer: (b) f(x) = x + 2
14- Answer: (d) Reflexive, transitive but not symmetric
15- Answer: (d) Equivalence relation
16- Answer: (c) many-one onto
17- Answer: (a) f is bijective
18- Answer: (c) one-one but not onto
19- Answer: (c) a bijection
20- Answer: (a) one-one but not onto
21- Answer: (b) one-one into
22- Answer: (a) a bijection
51

Common questions

Powered by AI

When the feasible region of a linear programming problem is unbounded, there is a possibility that the values of the objective function can be made infinitely large (for maximization problems) or infinitely small (for minimization problems). In such cases, while feasible solutions exist, there is no bounded maximum or minimum value, and the problem is often considered not to have a finite optimal solution .

A change in constraints in a linear programming problem requires re-evaluation because it might alter the feasible region and, consequently, the location of the optimal solution. Re-evaluation entails recalculating the corner points of the feasible region and checking these points in the objective function to determine the new optimal solution. It ensures the solution remains accurate under the altered constraints .

The corner-point method involves evaluating the objective function at each vertex of the feasible region, which is bounded. The maximum value of the objective function is found by calculating the function value at these vertices and selecting the vertex where the value is highest. This method relies on the property that the extreme values of a linear function subject to linear constraints occur at the region's vertices .

The function f(x) = 3x^4 + 4x^3 - 12x^2 + 12 is considered to have a local maxima at x = 0 because the first derivative f'(x) = 0 at x = 0, which is a necessary condition for local extrema. The second derivative f''(x) evaluates to less than 0 at x = 0, indicating the function is concave down at this point, thus confirming a local maximum .

In linear programming, the objective function represents the formula that needs to be maximized or minimized, such as profit or cost. It is expressed as a linear function of decision variables. Constraints, on the other hand, define the limits within which the decision variables must operate, often structured as inequalities based on resources or requirements. Together, they form the essential components of a linear programming model .

The graphical method involves plotting the constraints on a coordinate plane to form a feasible region. The vertices of this region are tested in the objective function Z = 3x + 5y to find the maximum value. The solution is the vertex that provides the highest value, considering the constraints 3x + 2y ≤ 18, x ≤ 4, y ≤ 6, and x, y ≥ 0. This process visually identifies the optimal solutions where the objective function intersects the boundaries of the feasible region .

In linear programming, a bounded feasible region is one that is closed and finite. This characteristic ensures that both maximum and minimum values of the objective function exist, as they will occur at one or more of the vertices of the feasible region. If the region is unbounded, the objective function may tend towards infinity, making an optimal solution impossible to determine .

The maximum value of Z = p*x + q*y occurs at multiple vertices of the feasible region if the line corresponding to Z is parallel to one of the constraints that pass through these vertices. For the given situation where vertices are (3,4) and (0,5), the condition is p/q = (5-4)/(0-3) = -1/3. Thus, p/q must be equal for the Z line to coincide with both vertices simultaneously .

The assertion and reason structure helps in validating the behavior of functions at critical points. An assertion states an observation such as "x = 0 is a point of local maxima," while the reason provides justification, such as evaluating f'(x) and f''(x) to confirm the derivative tests' conditions. This logical structure aids in accurately verifying and explaining function behavior regarding local maxima or minima .

The function f(x) = e^x does not have local maxima or minima because its derivative, f'(x) = e^x, is always positive for all real values of x. This indicates the function is continuously increasing and does not change direction, thus preventing any local maximum or minimum from existing .

You might also like