for a linear programming problem and let Z = ax + by be the objective function. When Z has an optimal value (maximum or minimum), where the variables x and y are subject to constraints described ...

CBSE Class 12 Mathematics Chapter 12 Linear Programming ... all the constraints including non-negative constraints x ≥ 0, y ≥ 0 of an LPP is called the feasible region for the problem.