Abstract
This paper considers heuristic procedures for general mixed integer linear programming with inequality constraints. It focuses on the question of how to most effectively initialize such procedures by constructing an “interior path” from which to search for good feasible solutions. These paths lead from an optimal solution for the corresponding linear programming problem (i.e., deleting integrality restrictions) into the interior of the feasible region for this problem. Previous methods for constructing linear paths of this kind are analyzed from a statistical viewpoint, which motivates a promising new method. These methods are then extended to piecewise linear paths in order to improve the direction of search in certain cases where constraints that are not binding on the optimal linear programming solution become particularly relevant. Computational experience is reported.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.