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

1. Question

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

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

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

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

6. Question

7. Question

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

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

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

11. Question

12. Question

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

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

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

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

17. Question

18. Question

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

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

21. In a LPP, the objective function is always

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

23. A feasible solution to an LP problem,

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

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

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

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

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

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

30. Question

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

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

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

34. Question

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

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

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

38. Feasible region in the set of points which satisfy

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

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

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

42. Question

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

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

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

46. Objective function of a linear programming problem is

47. Which of the following statements is correct ?