Mathbee CBSE Mathbee · CBSE Class 12 Maths
CBSE Class 12 Mathematics 2026 Main Paper 65/1/1 · Q171 Markslinear_programming

CBSE Class 12 Mathematics 2026 Main Paper 65/1/1 · Question 17 (Linear Programming)

The feasible region of a linear programming problem with objective function Z = 5x + 7y is shown below. The maximum value of Z − minimum value of Z is
Feasible polygon with vertices (0,0),(7,0),(3,4),(0,2).
Feasible polygon with vertices (0,0),(7,0),(3,4),(0,2).

✅ Step-by-Step Solution

Final Answer: (D) 43
  1. Vertices of feasible region from graph: (0,0), (7,0), (3,4), (0,2).
  2. Z at these: 0, 35, 43, 14 respectively.
  3. Max = 43, Min = 0, Difference = 43.

Master Chapter 12: Linear Programming

Practise interactive questions, flashcards, visual mind maps, and timed board tests for Linear Programming.
📘 Chapter Notes & All Exercises 🚀 Open Interactive Workspace →
← Previous Question
The length of perpendicular drawn from point (2, 5, 7) on line x/1 =…
Next Question →
The degree of an objective function of a linear programming problem is

All Questions in CBSE Class 12 Mathematics 2026 Main Paper 65/1/1

Q1Q2Q3Q4Q5Q6Q7Q8Q9Q10Q11Q12Q13Q14Q15Q16Q17Q18Q19Q20Q21Q22Q23Q24Q25Q26Q27Q28Q29Q30Q31Q32Q33Q34Q35Q36Q37Q38

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.