Class CBSE Class 12 Mathematics Linear Programming Q #1734
KNOWLEDGE BASED 1 Marks 2026 AISSCE(Board Exam) MCQ SINGLE
In the graph, the feasible region representing the Linear Programming Problem for maximising objective function $Z=px+qy$, $p, q>0$ is shaded. If all points on segment AB give max (Z), then which of the following is true? [Graph shows A at (0, 5) and B at (3, 4)]
(A) $p=2q$
(B) $p=3q$
(C) $q=3p$
(D) $q=2p$
Prev Next

More from this Chapter

SA
Solve graphically the following linear programming problem : Maximise \(z = 6x + 3y\), subject to the constraints\begin{align} 4x + y &\ge 80 \\ 3x + 2y &\le 150 \\ x + 5y &\ge 115 \\ x, y &\ge 0 \end{align}
MCQ_SINGLE
The number of corner points of the feasible region determined by the constraints x-y\ge0, 2y\le x+2, x\ge0, y\ge0 is:
SA
Solve the following Linear Programming Problem using graphical method: Maximise $Z=100x+50y$ subject to the constraints $3x+y\le600$, $x+y\le300$, $y\le x+200$, $x\ge0$, $y\ge0$.
MCQ_SINGLE
In a linear programming problem, the linear function which has to be maximized or minimized is called
MCQ_SINGLE
The region represented by the system of inequations $3x+y\ge 3$, $2x-y\ge -5$, $x, y\ge 0$ is:
View All Questions