Class 12 Linear Programming · Mcq Single Correct1 Marksfeasible_region
Class 12 Maths · Linear Programming · Mcq Single Correct #1
How many feasible solutions satisfy 3x+y≤12, x+2y≤10, x,y≥0?
✅ Step-by-Step Solution
Final Answer: Option (D): Infinitely many
- The feasible region contains a nondegenerate triangle near the origin, hence infinitely many feasible points. Feasible and optimal solutions are distinct concepts.
Master Chapter 12: Linear Programming
Practise interactive questions, flashcards, visual mind maps, and timed board tests for Linear Programming.
More Practice Questions in Linear Programming
Related Questions in Linear Programming
Class 12 Linear Programming · Mcq Single Correct
The shaded first-quadrant region lies above both x+2y=4 and x+y=3. Which constraints describe…
Class 12 Linear Programming · Mcq Single Correct
Z=ax+by has maximum 42 at (4,6) and minimum 19 at (3,2). Find a,b.
Class 12 Linear Programming · Mcq Single Correct
A bounded feasible polygon has vertices (2,72),(15,20),(40,15). For Z=18x+9y, select the…
Class 12 Linear Programming · Mcq Single Correct
How many vertices does x−y≥0, 2y≤x+2, x,y≥0 have?
Class 12 Linear Programming · Mcq Single Correct
A bounded feasible polygon has vertices (0,3),(3,2),(0,5). Find the minimum of Z=11x+7y.
CBSE Class 12 Mathematics 2026 Main Paper 65/1/1 · Q17
The feasible region of a linear programming problem with objective function Z = 5x + 7y is…