An upper bound on the number of non-unique assignments in relaxed (mixed) integer linear programs of the assignment type

Abstract

An upper bound is given for the number of non-unique assignments when solving the linear programming relaxation of (mixed) integer linear programming problems in which the integer variables are governed by assignment type constraints. Key-words: (mixed) integer linear programming, assignment problems, class-room scheduling