Class 12 Linear Programming · Mcq Single Correct1 Markscorner_point_optimization
Class 12 Maths · Linear Programming · Mcq Single Correct #16
Vertices are P(0,5),Q(1,5),R(4,2),S(12,0). Where is Z=2x+5y minimum?
✅ Step-by-Step Solution
Final Answer: Option (C): R
- The values are 25,27,18,24; R minimizes.
Master Chapter 12: Linear Programming
Practise interactive questions, flashcards, visual mind maps, and timed board tests for Linear Programming.
← Previous Question
For x≥3,x≤9,y≥0,x−y≥0,x+y≤14, which describes the feasible region?
Next Question →For Z=2x−y+5 on 3x+4y≤60,x+3y≤30,x,y≥0, which statement is true?
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.