CUET Mathematics MCQs Linear Programming

Question : A feasible solution to a linear programming problem

a) Must satisfy all of the problem's constraints simultaneously

b) Need not satisfy all of the constraints, only the non-negativity constraints

c) Must be a corner point of the feasible region

d) Must give the maximum possible profit

Answer : A

Question : In maximization problem, optimal solution occurring at corner point yields the

a) highest value of z

b) lowest value of z

c) mid values of z

d) mean values of z

Answer : A

Question :  The corner points of the bounded feasible region of a LPP are A(0,50), B(20, 40), C(50, 100) and D(0, 200) and the objective function is Z = x + 2y. Then the maximum value is

a) 400

b) 250

c) 450

d) 100

Answer : A

Question : In a LPP, the objective function is always

a) Linear

b) Quadratic

c) Cubic

d) Biquadratic

Answer : A

Question :  The feasible region (shaded) for a L.P.P is shown in the figure. The maximum Z = 5x + 7y is

a) 43

b) 47

c) 45

d) 49

Answer : A