Start learning →

Theorem 1 describes the feasible region as a:

AConcave curve
BBroken circle
CSingle points
DConvex polygon
Answer & Solution
Correct answer: D. Convex polygon
1. The region is bounded by straight constraint lines. 2. Those lines meet at vertices. 3. The theorem calls it a convex polygon. 4. So the answer is a convex polygon. _Source: syllabus Mathematics, Ch 12 'Linear Programming'_
Practise this question with Quill — AP Intermediate 2nd Year →

Keep practising Linear Programming

Browse all Linear Programming questions for AP Intermediate 2nd Year, or explore more Mathematics topics.

Start a Linear Programming lesson →
Related questions
Linear programming problems seek to maximise or:If the feasible region is unbounded, an optimum may:Linear programming numbersFeasible or infeasible?If the feasible region R is bounded, Z has:The optimal value of Z occurs at which points of the region?Linear programming problems here are solved by which method?Points within and on the boundary of the feasible region are: