Date of Original Version

2-1-2006

Type

Article

Rights Management

The original publication is available at www.springerlink.com

Abstract or Description

We present an algorithm for finding a feasible solution to a convex mixed integer nonlinear program. This algorithm, called Feasibility Pump, alternates between solving nonlinear programs and mixed integer linear programs. We also discuss how the algorithm can be iterated so as to improve the first solution it finds, as well as its integration within an outer approximation scheme. We report computational results.

DOI

10.1007/s10107-008-0212-2