Disjunctive programming, or optimization over unions of polyhedra, developed in the seventies, was shown in the nineties to provide an efficient way of solving mixed 0-1 programming problems. Lifting the problem into a higher dimensional space where a tighter formulation is obtained, we then project back this higher dimensional polyhedron to the original space. This talk will address issues concerning alternative ways of generating the projected cuts.