alleryLinear programming problems here are solved by which method?
AGraphical
BNumerical
CIterative
DRecursive
Answer & Solution
Correct answer: A. Graphical
1. The constraints are drawn as lines on a plane.
2. The region between them is then read off.
3. So the problems are solved by the graphical method.
4. The answer is graphical.
_Source: syllabus Mathematics, Ch 12 'Linear Programming'_
Keep practising Linear Programming
Browse all Linear Programming questions for AP Intermediate 2nd Year, or explore more Mathematics topics.
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?Points within and on the boundary of the feasible region are:A point outside the feasible region is an: