Start learning →

The conditions $x \ge 0,\ y \ge 0$ in an LPP are called the:

Anon-negative constraints
Bfeasible bounds
Cobjective function
Dcorner points
Answer & Solution
Correct answer: A. non-negative constraints
x ≥ 0, y ≥ 0 are the non-negative (non-negativity) constraints.
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: