A feasible solution of a LPP if it also optimizes the objective function is called
The linear inequalities or equations or restrictions on the variables of a linear programming problem are called...... The conditions x ≥ 0, y ≥ 0 are called.......