Skip to main contentSkip to solution

The number of feasible solutions of the linear programming problem as

Maximum z=15x+30yz=15x+30y subject to the constraints

3x+y≤123x+y \leq 12

x+2y≤10x+2y \leq 10

x≥0,y≥0x \geq 0, y \geq 0

is

Solution

✅ Correct Option: 4

The constraints define a bounded polygonal region in the first quadrant with non-empty interior. Every point of that region satisfies all constraints, so there are infinitely many feasible solutions; only the corner points are candidates for the optimum.

Keyboard Shortcuts

  • Left arrow: Previous question
  • Right arrow: Next question
  • S key: Jump to solution
  • Q key: Jump to question