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

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

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

a.A constraint

b.Function to be optimized

c.None of these

d.A relation between the variables

2. Question

a.360 at (18, 0)

b.0 at (0, 0)

c.540 at (0, 60)

d.336 at (6, 24)

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

a.60 at (4, 2)

b.62 at (4, 0)

c.44 at (4, 2)

d.48 at (4, 2)

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

a.Have solution for all y

b.Have no solution for positive x and y

c.Have solution for positive x and y

d.Have solution for all x

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

a.33 at (6, 3)

b.20 at (1, 0)

c.30 at (0, 6)

d.37 at (4, 5)

6. Question

a.(3.5, 0)

b.(3, 3)

c.(7.5, 0)

d.(2, 3)

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

a.None of these

b.24

c.40

d.32

8. Objective function of a linear programming problem is

a.A relation between the variables

b.Function to be optimized

c.None of these

d.A constraint

9. 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.None of these

b.Optimum solution

c.Feasible solution

d.Unbounded solution

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

a.On X-axis

b.On Y-axis

c.None of these

d.Corner points of the feasible region

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

a.60 at (4, 2)

b.44 at (4, 2)

c.48 at (4, 2)

d.62 at (4, 0)

12. Question

a.(0, 8)

b.(0, 0)

c.(5, 0)

d.(6, 10)

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

a.None of these

b.40

c.30

d.36

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

a.33 at (6, 3)

b.20 at (1, 0)

c.30 at (0, 6)

d.37 at (4, 5)

15. 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.(1.5, 4)

b.(7, 0)

c.(0, 7)

d.(4.5, 2)

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

17. Question

a.a

b.b

c.c

d.d

18. 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.300

b.600

c.400

d.800

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

a.A constraint

b.A Function to be optimized

c.A relation between the variables

d.None of these

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

a.Highest value of Z

b.Mid values of Z

c.Lowest value of Z

d.Mean values of Z

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

a.bounded in first quadrant

b.unbounded in first quadrant

c.None of these

d.unbounded in first and second quadrant

22. Question

a.b

b.a

c.d

d.c

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

a.A constraint

b.None of these

c.Decision variables

d.Objective function

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

a.230

b.300

c.220

d.None of these

25. Question

a.b

b.d

c.a

d.c

26. 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. x ≥ 6

b. x ≥ 6, y ≥ 2

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

d.None of these

27. Question

a.30 at (3, 0)

b.80 at (3, 2)

c.75 at (0, 3)

d.95 at (2, 3)

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

a.10

b.5

c.7

d.11

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

a.(2, 3)

b.(1, 2)

c.(2, 1)

d.(-3, 2)

30. In a LPP, the objective function is always

a.Biquadratic

b.Quadratic

c.Cubic

d.Linear

31. 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.80

b.70

c.72

d.82

32. 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.120

d.140

33. Feasible region in the set of points which satisfy

a.The objective functions

b.All of the given constraints

c.Some the given constraints

d.None of these

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

a.16 at (4, 0)

b.24 at (6, 0)

c.24 at (0, 4)

d.36 at (0, 6)

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

a.(2,1)

b.(-2,3)

c.(1,2)

d.(2,3)

36. 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.35

c.36

d.34

37. A feasible solution to an LP problem,

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

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

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

d.Must optimize the value of the objective function.

38. 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.(6, 0)

b.(1, 0)

c.(0, 3)

d.(0, 5)

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

a.At the boundary line of the feasible region

b.None of these

c.Vertex point of the boundary of the feasible region

d.Inside the feasible region

40. Question

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

b.The two quantities are equal

c.The quantity in column B is greater

d.The quantity in column A is greater

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

a.On Y-axis

b.Which are corner points of the feascible region

c.None of these

d.On X-axis

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

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

a.Second quadrant

b.Fourth quadrant

c. Third quadrant

d.First quadrant

44. Question

a.c

b.d

c.b

d.a

45. Which of the following statements is correct ?

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

b.Every LP problem has a unique solution.

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

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

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

a.Diet Problem

b.Manufacturing problem

c.Transportation problesm

d.All of the above

47. Question

a.30 at (3, 0)

b.95 at (2, 3)

c.80 at (3, 2)

d.75 at (0, 3)

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