Class 12 Linear Programming · Mcq Single Correct1 Marksmultiple_optima
Class 12 Maths · Linear Programming · Mcq Single Correct #12
A linear objective attains its maximum at two distinct feasible vertices. How many optimal points are there?
✅ Step-by-Step Solution
Final Answer: Option (D): Infinitely many
- Convexity makes their entire joining segment feasible and linearity keeps the same objective value.
Master Chapter 12: Linear Programming
Practise interactive questions, flashcards, visual mind maps, and timed board tests for Linear Programming.
← Previous Question
A bounded feasible polygon has vertices…
Next Question →Vertices are (0,3),(1,1),(3,0), and Z=px+qy with p,q>0. For minima…
More Practice Questions in Linear Programming
Related Questions in Linear Programming
Class 12 Linear Programming · Mcq Single Correct
How many feasible solutions satisfy 3x+y≤12, x+2y≤10, x,y≥0?
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.