Optimization Online


A Feasibility Pump for Mixed Integer Nonlinear Programs

Pierre Bonami (pbonami***at***andrew.cmu.edu)
Gérard Cornuéjols (gc0v***at***andrew.cmu.edu)
Andrea Lodi (alodi***at***deis.unibo.it)
Francois Margot (fmargot***at***andrew.cmu.edu)

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

Keywords: Mixed Integer Nonlinear Programming, Heuristics

Category 1: Integer Programming ((Mixed) Integer Nonlinear Programming )

Citation: IBM Research Report RC23862, February 2 2006

Download: [PDF]

Entry Submitted: 02/08/2006
Entry Accepted: 02/08/2006
Entry Last Modified: 02/08/2006

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society