MCQ
A Linear Programming Problem is as follows:
Minimize Z = 2x + y
Subject to the constraints $x \geq 3, x \leq 9, y \geq 0$
$x-y \geq 0, x+y \leq 14$
The feasible region has
  • A
    5 corner points including (0, 0) and (9, 5)
  • B
    5 corner points including (7, 7) and (3, 3)
  • C
    5 corner points including (3, 6) and (9, 5)
  • D
    5 corner points including (14, 0) and (9, 0)

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