alleryThe conditions x >= 0 and y >= 0 are called:
ANon-negative ones
BObjective values
CCorner point sets
DUnbounded region
Answer & Solution
Correct answer: A. Non-negative ones
1. Quantities like tables and chairs cannot be negative.
2. Those particular constraints get their own name.
3. They are the non-negative restrictions.
4. So the answer is non-negative ones.
_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: