Mathbee · CBSE Class 12 Maths

Class 12 Linear Programming · Mcq Single Correct1 Markscorner_point_optimization

Class 12 Maths · Linear Programming · Mcq Single Correct #14

For a nonempty bounded feasible polygon, a linear objective attains an optimum at:

(A) Its intersection with the y-axis only
(B) Its intersection with the x-axis only
(C) At least one vertex
(D) None of these

✅ Step-by-Step Solution

Final Answer: Option (C): At least one vertex

The corner-point theorem guarantees an optimal vertex; an entire edge can also be optimal.

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

Vertices are (0,3),(1,1),(3,0), and Z=px+qy with p,q>0. For minima…

Next Question →

For x≥3,x≤9,y≥0,x−y≥0,x+y≤14, which describes the feasible region?

More Practice Questions in Linear Programming

Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10 Q11 Q12 Q13 Q14 Q15 Q16 Q17 Q18 Q19 Q20 Q21 Q22 Q23 Q24 Q25 Q26 Q27 Q28 Q29 Q30 Q31 Q32 Q33 Q34 Q35 Q36 Q37 Q38 Q39 Q40

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.