A New Class of Sufficient Optimality Conditions for Integer Programming

Abstract

The purpose of this report is to present a new class of sufficient optimality conditions for pure and mixed integer programming problems. Some of the sets of sufficient conditions presented can be thought of as generalizations of optimality conditions based on primal-dual complementarity in linear programming, and these sufficient conditions are particularly useful for the construction of difficult integer programming test problems with known optimal solutions.