Class 12 Linear Programming · Long Answer3 Marksgraphical_optimization
Class 12 Maths · Linear Programming · Long Answer #56
The line x+y=1 separates side A containing the origin from side B. Which side solves x+y>1? Justify.
✅ Step-by-Step Solution
Final Answer: Side B, excluding the line.
- Draw x+y=1 through (1,0),(0,1).
- Test (0,0): 0>1 is false.
- Select the opposite half-plane, B. The strict inequality excludes the boundary.
- The solution is the open half-plane x+y>1.
📋 CBSE Stepwise Marking Scheme
- [0.5 marks] Draw x+y=1 through (1,0),(0,1).
- [1 mark] Test (0,0): 0>1 is false.
- [1 mark] Select the opposite half-plane, B. The strict inequality excludes the boundary.
- [0.5 marks] The solution is the open half-plane x+y>1.
Master Chapter 12: Linear Programming
Practise interactive questions, flashcards, visual mind maps, and timed board tests for Linear Programming.
← Previous Question
Maximize Z=3*x + y subject to x + 2*y ≤ 2; 2*x + y ≤ 2; -x ≤ 0; -y ≤…
Next Question →Maximize Z=6*x + 16*y subject to -x - y ≤ -2; -x ≤ 0; -y ≤ 0. Solve…
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.