Variables which are introduced into linear programming problems so that the inequalities representing the constraints can be replaced by equations. Each equation will introduce one slack variable, for example if 2x+3y ≤ 30 then we introduce a slack variable s satisfying 2x+3y+s−30 = 0. This allows the algebraic method of solution known as the simplex method to be used.