# Linear Programming VBQs Class 12 Mathematics

VBQs Linear Programming Class 12 Mathematics with solutions has been provided below for standard students. We have provided chapter wise VBQ for Class 12 Mathematics with solutions. The following Linear Programming Class 12 Mathematics value based questions with answers will come in your exams. Students should understand the concepts and learn the solved cased based VBQs provided below. This will help you to get better marks in class 12 examinations.

## Linear Programming VBQs Class 12 Mathematics

Question. The 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 π , π > 0.Condition on π and πso that the maximum of π occurs at both ( 3, 4 ) and ( 0, 5) is
(a) π = π
(b) π = 2π
(c) π = 3π
(d) π = 3π

D

Question. Solution set of inequations π₯ β 2π¦ β₯ 0, 2π₯ β π¦ β€ β2 , π₯ β₯ 0, π¦ β₯ 0 is
(b) infinite
(c) Empty
(d) closed half plane

C

Question. 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

A

Question. 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

C

Question. 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

B

Question. The 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)

C

Question. Which of the term is not used in a linear programming problem :
(a) Slack inequation
(b) Objective function
(c) Concave region
(d) Feasible Region

C

Question. The solution set of the in equation 2π₯ + π¦ > 5 is
(a) Half plane that contains the origin
(b) Open half plane not containing the origin
(c) Whole π₯π¦ βplane except the points lying on the line 2π₯ + π¦ = 5
(d) None of these

B

Question. The 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.

C

Question. 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

A

Question. 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.

C

Question. The feasible solution of a LPP belongs to

D

Question. 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

B

Question. 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

D

Question. A linear programming of linear functions deals with :
(a) Minimizing
(b) Optimizing
(c) Maximizing
(d) None

B

Question. 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

B

Question. The maximum value of Z = 2x +3y subjectto the constraints :
π₯ + π¦ β€ 1 , 3π₯ + π¦ β€ 4 , π₯, π¦ β₯ 0is
(a) 2
(b) 4
(c) 5
(d) 3

C

Question. The point in the half plane 2π₯ + 3π¦ β 12 β₯ 0 is :
(a) (- 7,8 )
(b) ( 7 , – 8 )
(c) ( -7 , – 8 )
(d) (7, 8 )

D

Question. 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

A

Question. 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)

D

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.

Question. The objective function is
(a) 190π₯ + 300π¦
(b) 300π₯ + 190π¦
(c) π₯ + π¦
(d) none of the above

B

Question. Maximum profit earned by the firm is equal to
(a) 6440
(b) 4560
(c) 5000
(d) 5440

D

Question. Constraints of the above LPP are
(a) π₯ β€ 0
(b) 2π₯ + π¦ β€ 32
(c) π¦ β₯ 1
(d) none of the above

B

Question. 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

B

Question. Corner points of feasible region are
(a) (0,24)
(b) (8,16)
(c) a &b both
(d) (12,0)

C

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.

Question. Minimum profit is equal to
(a) 8000
(b) 6000
(c) 64000
(d) none of the above

A

Question. The objective function is
(a) 400π₯ + 300π¦
(b) 300π₯ + 400π¦
(c) π₯ + π¦
(d) none of the above

A

Question. To get maximum profit how many first class tickets should be sold β
(a) 20
(b) 180
(c) 160
(d) 40

D

Question. Corner points of feasible region are
(a) (20,180)
(b) (20,0)
(c) (40,0)
(d) all the above

D

Question. Difference between the maximum profit and minimum profit is equal to
(a) 8000
(b) 56000
(c) 64000
(d) none of the above

A

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.
(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.

Question. 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.

B

Question. 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 .

D

Question. 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 .

A

Question. 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 .