A linear programming problem must have constraints that are:
ACurved
BRandom
CLinear
DCubic
Answer & Solution
Correct answer: C. Linear
1. The name of the method gives it away.
2. Every restriction is written as a linear inequality or equation.
3. So the constraints are linear.
4. The answer is linear.
_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?Linear programming problems here are solved by which method?Points within and on the boundary of the feasible region are: