Home › JEE Main › mathematics › Linear Programming › The conditions $x \ge 0,\ y \ge 0$ in an LPP are…
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.
Related questions
If a feasible region of an LPP is empty, the problem isHungarian method for assignment problem requires the cost matrix to beAssignment problem is a special case ofMaximise Z = 3x + 2y subject to x + y ≤ 4, x ≥ 0, y ≥ 0. Maximum value of Z isIn LPP, optimal solution (if it exists) is found atThe feasible region of an LPP isIn a linear programming problem (LPP), the objective function isA linear program has an unbounded feasible region. The maximisation of the objective funct