Pseudo basic steps: Bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming

Dimitri J. Papageorgiou, Francisco Trespalacios

An elementary, but fundamental, operation in disjunctive programming is a basic step, which is the intersection of two disjunctions to form a new disjunction. Basic steps bring a d…