Construction of Plant Location Test Problems with Known Optimal Solutions
This report presents a procedure for the construction of plant location problem with known optimal solutions. Plant location problems can be formulated as mixed integer programming problems and thus provide a source of problems for testing integer programming codes. The data comprising these problems will be selected in such a manner that sufficient optimality conditions will be satisfied. Computational results are given to show that this procedure can efficiently generate difficult test problems of this type.