Class CBSE Class 12 Mathematics Linear Programming Q #1733
KNOWLEDGE BASED 1 Marks 2026 AISSCE(Board Exam) MCQ SINGLE
The corner points of the feasible region determined by the system of linear constraints are (0,0), (0, 40), (20, 40), (60, 20) and (60, 0). If the objective function of an LPP is $Z=4x+3y$, then the maximum value is :
(A) 200
(B) 300
(C) 240
(D) 120
Prev Next

More from this Chapter

SA
Solve the following Linear Programming Problem graphically: Maximise $Z=200x+120y$ subject to the constraints $x+y\le 300$, $3x+y\le 600$, $x-y\ge -100$, $x,y\ge 0$
SA
Determine graphically the minimum value of the following objective function : $z=500x+400y$ subject to constraints $x+y\le200, x\ge20, y\ge4x, y\ge0$
LA
Solve the following Linear Programming Problem graphically: Maximise $Z=600x+400y$ subject to the constraints $x+2y\le12$, $2x+y\le12$, $4x+5y\ge20$, $x, y\ge0$
MCQ_SINGLE
The number of feasible solutions of the linear programming problem given as Maximize $z=15x+30y$ subject to constraints : $3x+y\le12, x+2y\le10, x\ge0, y\ge0$ is
SA
In the Linear Programming Problem for objective function $Z=18x+10y$ subject to constraints $4x+y\ge20$, $2x+3y\ge30$, $x,y\ge0$ find the minimum value of Z.
View All Questions