Equivalently, the k th constraint can be written as follows in boolean algebra notation: For the k th constraint, we introduce one more variable z k ∈ {0, 1} which satisfies the following condition: Using boolean algebra, it is easy to show that Equation (5) can be reduced to a set of linear inequalities.
we can incorporate the k th con- straint in the optimization problem by adding to it the constraint given by Equation 5and by subtracting (ρ 3 (1 − z k )) from the objective function given by Equation (1).