Experiments with a feasibility pump approach for nonconvex MINLPs

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We present a new Feasibility Pump algorithm tailored for nonconvex Mixed Integer Nonlinear Programming problems. Differences with the previously proposed Feasibility Pump algorithms and difficulties arising from nonconvexities in the models are extensively discussed. The main methodological innovations of this variant are: (a) the first subproblem is a nonconvex continuous Nonlinear Program, which is solved using global optimization techniques; (b) the solution method for the second subproblem is complemented by a tabu list. We exhibit computational results showing the good performance of the algorithm on instances taken from the MINLPLib.

Original languageEnglish
Title of host publicationExperimental Algorithms - 9th International Symposium, SEA 2010, Proceedings
PublisherSpringer Verlag
Pages350-360
Number of pages11
ISBN (Print)3642131921, 9783642131929
DOIs
Publication statusPublished - 1 Jan 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6049 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Keywords

  • Experiments
  • Heuristic method
  • Mixed-integer nonlinear programming
  • Nonconvex

Fingerprint

Dive into the research topics of 'Experiments with a feasibility pump approach for nonconvex MINLPs'. Together they form a unique fingerprint.

Cite this