At least /: out of m constraints must hold The following problem does not require all constraints to hold, but at least out of m must do: max c'x (18) a1r 0. (20) Reformulation Problem (18)-(20) can be equivalently reformulated as a mixed integer program by introducing some binary variables y's and a constant M whose value is set to be sufficiently large so that the constraint our k r 2 0, y binary.Reformulate the problem when \"exactly & out of m constraints must hold\" so that it can be solved by Gusek