Start learning →

Linear programming problems seek to maximise or:

AMinimise
BRandomise
CNormalise
DStabilise
Answer & Solution
Correct answer: A. Minimise
1. Such problems aim at the best possible outcome. 2. Profit is pushed up while cost is pushed down. 3. So they maximise or minimise a quantity. 4. The answer is minimise. _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: