We show that systems with two different cone bases associated with an integer linear programming problem are equivalent under a b-complementary Multisemigroup. In addition, we present Benders’ decomposition and algorithm for the dual problem of the a b-Complementary Multisemigroup. Author(s) Details Eleazar Madriz Lozada Center for Exact and Technological...