Technical Note—Equivalent Mixed Integer Programming Problems

Abstract

Every mixed integer programming problem is shown to be equivalent to an infinite number of other mixed integer programming problems. The optimal solution to any problem in a class determines the optimal solution to every other problem in the class. Canonical problems existing in every equivalence class may be solved in lieu of the original problem. For problems with rational data, the mixed Hermite canonical problem is introduced. A numerical example is included.