MCQ
A linear programming problem is as follows:
Minimize $Z=30 x+50 y$
Subject to the constraints,
$\begin{array}{l}3 x+5 y \geq 15 \\ 2 x+3 y \leq 18 \\ x \geq 0, y \geq 0\end{array}$
In the feasible region, the minimum value of $Z$ occurs at
  • A
    a unique point
  • B
    no point
  • C
    infinitely many points
  • D
    two points only

Need a full question paper?

Generate a complete, print-ready paper with questions like this in minutes — across 16+ boards, with answer keys.

Start Generating Free