The condition l_j ≤ x_j, l_j ≠ 0, defines x_j as a lowerbounded variable. Such conditions are often part of the constraint set of an optimization problem. For linear-programming, these conditions can be removed explicitly by appropriate transformations, given that the problem is feasible when x_j = l_j for each j.