Class 12 Linear Programming · Conceptual Answer1 Marksbounded_and_unbounded_regions
Class 12 Maths · Linear Programming · Conceptual Answer #26
Is x+y≥1,x,y≥0 bounded? Justify.
✅ Step-by-Step Solution
Final Answer: No; it is unbounded.
- Every point (t,0), t≥1, is feasible and has arbitrarily large distance from the origin.
- No; it is unbounded.
📋 CBSE Stepwise Marking Scheme
- [0.5 marks] Every point (t,0), t≥1, is feasible and has arbitrarily large distance from the origin.
- [0.5 marks] No; it is unbounded.
Master Chapter 12: Linear Programming
Practise interactive questions, flashcards, visual mind maps, and timed board tests for Linear Programming.
← Previous Question
Find max Z=3x+y on x+2y≤2,2x+y≤2,x,y≥0.
Next Question →Minimize Z=13*x - 15*y subject to x + y ≤ 7; -2*x + 3*y ≤ 6; -x ≤ 0…
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.