Formulating a Mixed Integer Programming Problem to Improve Solvability
Cynthia Barnhart, Ellis L. Johnson, George L. Nemhauser, Gabriele Sigismondi, Pamela Vance
Operations Research · 1993 · Volume 41 · Issue 6
Abstract
A standard formulation of a real-world distribution problem could not be solved, even for a good solution, by a commercial mixed integer programming code. However, after reformulating it by reducing the number of 0-1 variables and tightening the linear programming relaxation, an optimal solution could be found efficiently. The purpose of this paper is to demonstrate, with a real application, the practical importance of the need for good formulations in solving mixed integer programming problems.
Keywords
programming, integer, algorithms: solving a distribution problem, transportation, models: solving a distribution problem
Enable JavaScript for citation tools and additional paper interactions.