Mathbee CBSE Mathbee · CBSE Class 12 Maths
CBSE Class 12 Mathematics 2026 Supplementary Paper 65(B)/7 · Q151 Markscorner_point_method

CBSE Class 12 Mathematics 2026 Supplementary Paper 65(B)/7 · Question 15 (Linear Programming)

In a linear programming problem with a feasible polygon and an attained optimum, where can an optimum be found?

✅ Step-by-Step Solution

Final Answer: At a corner of the feasible region
  1. The corner-point theorem ensures at least one corner attains the optimum. A boundary segment can share that value.

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
If px+y takes minimum 14 at (3,2), find p.
Next Question →
Find the probability of at least one head in three independent fair…

All Questions in CBSE Class 12 Mathematics 2026 Supplementary Paper 65(B)/7

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.