CUET 2024 Maths Chapter 12 - Linear Programming MCQ Question and Answers

Maths Chapter 12 – Linear Programming MCQ Question Answers for CUET 2024

1. Of all the points of the feasible region for maximum or minimum of objective function the points

a.Inside the feasible region

b.None of these

c.At the boundary line of the feasible region

d.Vertex point of the boundary of the feasible region

2. The point which does not lie in the half-plane 2x + 3y -12 < 0 is:

a.(-2,3)

b.(2,1)

c.(1,2)

d.(2,3)

3. Question

a.b

b.d

c.c

d.a

4. Objective function of a linear programming problem is

a.Function to be optimized

b.A relation between the variables

c.None of these

d.A constraint

5. In a LPP, the objective function is always

a.Biquadratic

b.Cubic

c.Quadratic

d.Linear

6. A set of values of decision variables that satisfies the linear constraints and non-negativity conditions of an L.P.P. is called its:

a.Feasible solution

b.Optimum solution

c.None of these

d.Unbounded solution

7. Which of the following is a type of Linear programming problem?

a.All of the above

b.Diet Problem

c.Manufacturing problem

d.Transportation problesm

8. The maximum value of f = 4x + 3y subject to constraints x ≥ 0, y ≥ 0, 2x + 3y ≤ 18; x + y ≥ 10 is

a.None of these

b.36

c.35

d.34

9. The maximum value of z = 3x + 2y subject to x + 2y ≥ 2, x + 2y ≤ 8, x, y ≥ 0 is

a.24

b.40

c.32

d.None of these

10. The objective function of a linear programming problem is:

a.A relation between the variables

b.Function to be optimized

c.A constraint

d.None of these

11. The maximum value of the object function Z = 5x + 10 y subject to the constraints x + 2y ≤ 120, x + y ≥ 60, x – 2y ≥ 0, x ≥ 0, y ≥ 0 is

a.400

b.600

c.800

d.300

12. The optimal value of the objective function is attained at the points

a.None of these

b.Which are corner points of the feascible region

c.On Y-axis

d.On X-axis

13. Z = 8x + 10y, subject to 2x + y ≥ 1, 2x + 3y ≥ 15, y ≥ 2, x ≥ 0, y ≥ 0. The minimum value of Z occurs at

a.(4.5, 2)

b.(0, 7)

c.(7, 0)

d.(1.5, 4)

14. Question

a.(0, 8)

b.(0, 0)

c.(6, 10)

d.(5, 0)

15. Corner points of the bounded feasible region for an LP problem are A(0,5) B(0,3) C(1,0) D(6,0). Let z=−50x + 20y be the objective function. Minimum value of z occurs at ______ center point.

a.(0, 3)

b.(0, 5)

c.(1, 0)

d.(6, 0)

16. Maximize Z = 4x + 6y, subject to 3x + 2y ≤ 12, x + y ≥ 4, x, y ≥ 0

a.24 at (6, 0)

b.24 at (0, 4)

c.16 at (4, 0)

d.36 at (0, 6)

17. A set of values of decision variables which satisfies the linear constraints and nn-negativity conditions of a L.P.P. is called its

a.Feasible solution

b.Unbounded solution

c.Optimum solution

d.None of these

18. In equation 3x – y ≥ 3 and 4x – 4y > 4

a.Have solution for all y

b.Have solution for positive x and y

c.Have no solution for positive x and y

d.Have solution for all x

19. Feasible region in the set of points which satisfy

a.All of the given constraints

b.The objective functions

c.None of these

d.Some the given constraints

20. Question

a.c

b.a

c.d

d.b

21. The region represented by the inequation system x, y ≥ 0, y ≤ 6, x + y ≤ 3 is

a.bounded in first quadrant

b.None of these

c.unbounded in first quadrant

d.unbounded in first and second quadrant

22. Objective function of a L.P.P.is

a.A relation between the variables

b.A Function to be optimized

c.A constraint

d.None of these

23. Question

a.360 at (18, 0)

b.336 at (6, 24)

c.540 at (0, 60)

d.0 at (0, 0)

24. Question

a.30 at (3, 0)

b.80 at (3, 2)

c.95 at (2, 3)

d.75 at (0, 3)

25. Maximize Z = 11 x + 8y subject to x ≤ 4, y ≤ 6, x + y ≤ 6, x ≥ 0, y ≥ 0.

a.44 at (4, 2)

b.48 at (4, 2)

c.62 at (4, 0)

d.60 at (4, 2)

26. Question

a.a

b.c

c.b

d.d

27. Maximize Z = 3x + 5y, subject to x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0

a.37 at (4, 5)

b.20 at (1, 0)

c.33 at (6, 3)

d.30 at (0, 6)

28. The maximum value of Z = 3x + 4y subjected to constraints x + y ≤ 4, x ≥ 0 and y ≥ 0 is:

a.None of these

b.12

c.14

d.16

29. The maximum value of Z = 3x + 4y subjected to constraints x + y ≤ 40, x + 2y ≤ 60, x ≥ 0 and y ≥ 0 is

a.100

b.160

c.140

d.120

30. Question

a.(7.5, 0)

b.(3, 3)

c.(3.5, 0)

d.(2, 3)

31. In solving the LPP: “minimize f = 6x + 10y subject to constraints x ≥ 6, y ≥ 2, 2x + y ≥ 10, x ≥ 0, y ≥ 0” redundant constraints are

a.None of these

b. x ≥ 6

c.2x + y ≥ 10, x ≥ 0, y ≥ 0

d. x ≥ 6, y ≥ 2

32. A feasible solution to an LP problem,

a.Must satisfy all of the problem’s constraints simultaneously.

b.Must optimize the value of the objective function.

c.Need not satisfy all of the constraints, only some of them.

d.Must be a corner point of the feasible region.

33. Question

a.b

b.d

c.a

d.c

34. Question

a.The two quantities are equal

b.The relationship cannot be determined On the basis of the information supplied

c.The quantity in column B is greater

d.The quantity in column A is greater

35. Question

a.80 at (3, 2)

b.95 at (2, 3)

c.75 at (0, 3)

d.30 at (3, 0)

36. In maximization problem, optimal solution occurring at corner point yields the

a.Mean values of Z

b.Highest value of Z

c.Lowest value of Z

d.Mid values of Z

37. Which of the following statements is correct ?

a.If an LP problem has two optimal solutions, then it has infinitely many solutions.

b.Every LP problem has a unique solution.

c.Every LP problem has at least one optimal solution.

d.If a feasible region is unbounded then LP problem has no solution

38. The optimal value of the objective function is attained at the points:

a.On X-axis

b.Corner points of the feasible region

c.None of these

d.On Y-axis

39. The minimum value of Z = 4x + 3y subjected to the constraints 3x + 2y ≥ 160, 5 + 2y ≥ 200, 2y ≥ 80; x, y ≥ 0 is

a.300

b.None of these

c.220

d.230

40. For the LP problem maximize z = 2x + 3y The coordinates of the corner points of the bounded feasible region are A(3, 3), B(20,3), C(20, 10), D(18, 12) and E(12, 12). The minimum value of z is

a.70

b.82

c.72

d.80

41. The linear inequalities or equations or restrictions on the variables of a linear programming problem are called:

a.A constraint

b.Objective function

c.Decision variables

d.None of these

42. The point which does not lie in the half plane 2x + 3y -12 < 0 is

a.(1, 2)

b.(-3, 2)

c.(2, 1)

d.(2, 3)

43. Region represented by x ≥ 0, y ≥ 0 is:

a.Fourth quadrant

b.First quadrant

c. Third quadrant

d.Second quadrant

44. The maximum value of Z = 4x + 2y subject to the constraints 2x + 3y ≤ 18, x + y ≥ 10, x, y ≤ 0 is

a.36

b.None of these

c.30

d.40

45. Maximize Z = 11x + 8y, subject to x ≤ 4, y ≤ 6, x ≥ 0, y ≥ 0.

a.48 at (4, 2)

b.62 at (4, 0)

c.60 at (4, 2)

d.44 at (4, 2)

46. The minimum value of Z = 3x + 5y subjected to constraints x + 3y ≥ 3, x + y ≥ 2, x, y ≥ 0 is:

a.10

b.11

c.5

d.7

47. Maximize Z = 3x + 5y, subject to constraints: x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0

a.37 at (4, 5)

b.30 at (0, 6)

c.33 at (6, 3)

d.20 at (1, 0)

Also See :

Maths Ch 1 – Relations and Functions MCQs
Maths Ch 2 – Inverse Trigonometric Functions MCQs
Maths Ch 3 – Matrices MCQs
Maths Ch 4 – Determinants MCQs
Maths Ch 5 – Continuity and Differentiability MCQs
Maths Ch 6 – Applications of Derivatives MCQs
Maths Ch 7 – Integrals MCQs
Maths Ch 8 – Application of the Integrals MCQs
Maths Ch 9 – Differential Equations MCQs
Maths Ch 10 – Vectors MCQs
Maths Ch 11 – Three Dimensional Geometry MCQs
Maths Ch 13 – Multiplication Theorem Probability MCQs

CUET 2024 Maths Chapter 12 – Linear Programming MCQ Question and Answers – MCQs for Practice

Maths Chapter 12 – Linear Programming MCQ Question Answers for CUET 2024

Submit a Comment Cancel reply

Latest Posts

General

Important Days

CBSE School Lessons

Popular Pages

Entrance Exams

Top Entrance Exams

Admission Information

Career and Jobs

Education India