Comedk
Linear Programming
COMEDK 2025 Morning Shift
MCQ+1 / -02025
For a given Linear Programming problem, the objective function is
\(z=3 x+2 y\)
Subject to constraints are
$$\begin{aligned} & 4 x+3 y \leq 60 \\ & x \geq 3 \\ & y \leq 2 x \\ & y \geq 0 \end{aligned}$$
P is one of the corner points of the feasible region for the given Linear Programming problem. Then the coordinate of P is
