Formulating a mixed integer programming problem to improve solvability

Formulating a mixed integer programming problem to improve solvability

0.00 Avg rating0 Votes
Article ID: iaor1995219
Country: United States
Volume: 41
Issue: 6
Start Page Number: 1013
End Page Number: 1019
Publication Date: Nov 1993
Journal: Operations Research
Authors: , , , ,
Keywords: transportation: road, Transportation: Road, programming: transportation, transportation: general, programming: integer
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.

Reviews

Required fields are marked *. Your email address will not be published.