Skip to main content
Log in

A Feasibility Pump for mixed integer nonlinear programs

  • FULL LENGTH PAPER
  • Published:
Mathematical Programming Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Achterberg T. and Berthold T. (2007). Improving the feasibility pump. Discrete Optim. 4: 77–86

    Article  MATH  MathSciNet  Google Scholar 

  2. Bertacco L., Fischetti M. and Lodi A. (2007). A feasibility pump heuristic for general mixed-integer problems. Discrete Optim. 4: 63–76

    Article  MATH  MathSciNet  Google Scholar 

  3. Boddy M. and Johnson D. (2003). A new method for the global solution of large systems of continuous constraints. In: Bliek, C., Jermann, C. and Neumaier, A. (eds) Global Optimization and Constraint Satisfaction, pp 142–156. Springer, Berlin

    Google Scholar 

  4. Bonami, P., Wächter, A., Biegler, L.T., Conn, A.R., Cornuéjols, G., Grossmann, I.E., Laird, C.D., Lee, J., Lodi, A., Margot, F., Sawaya, N.W.: An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optim. (2008, in press)

  5. COIN-OR. http://www.coin-or.org

  6. \({\tt Dicopt}\) . http://www.gams.com/solvers/dicopt/main.htm

  7. Duran M. and Grossmann I.E. (1986). An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math. Program. 36: 307–339

    Article  MATH  MathSciNet  Google Scholar 

  8. Fiacco, A.V., McCormick, G.P.: Nonlinear Programming: Sequential Unconstrained Minimization Techniques. Wiley, London (1968). Republished 1990, SIAM Philadelphia

  9. Fischetti M., Glover F. and Lodi A. (2005). The Feasibility Pump. Math. Program. 104: 91–104

    Article  MATH  MathSciNet  Google Scholar 

  10. Mangasarian, O.L.: Nonlinear Programming. McGraw-Hill, NY (1969). Reprint: SIAM Classic in Applied Mathematics 10, 1994, Philadelphia

  11. Nowak I. (2005). Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming. Birkhäuser, Basel

    MATH  Google Scholar 

  12. \({\tt Sbb}\) . http://www.conopt.com/sbb/SBB_announcement.htm

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to François Margot.

Additional information

P. Bonami is supported in part by a grant from IBM and by ANR grant BLAN06-1-138894.

G. Cornuéjols is supported in part by NSF grant CMMI-0653419, ANR grant BLAN06-1-138894 and ONR grant N00014-03-1-0188.

Part of this research was carried out when Andrea Lodi was Herman Goldstine Fellow of the IBM T.J. Watson Research Center whose support is gratefully acknowledged.

F. Margot is supported in part by a grant from IBM and by ONR grant N00014-03-1-0188.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bonami, P., Cornuéjols, G., Lodi, A. et al. A Feasibility Pump for mixed integer nonlinear programs. Math. Program. 119, 331–352 (2009). https://doi.org/10.1007/s10107-008-0212-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-008-0212-2

Mathematics Subject Classification (2000)

Navigation