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

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

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

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

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

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

6. Objective function of a linear programming problem is

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

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

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

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

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

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

13. Question

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

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

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

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

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

19. Feasible region in the set of points which satisfy

20. Question

21. A feasible solution to an LP problem,

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

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

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

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

26. Which of the following statements is correct ?

27. Question

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

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

30. Question

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

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

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

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

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

36. Question

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

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

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

40. Question

41. Question

42. Question

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

44. Question

45. Question

46. In a LPP, the objective function is always

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