Lifted polyhedral approximations in convex mixed integer nonlinear programming

Research output: Chapter in Book/Conference proceedingConference contributionScientificpeer-review

Abstract

Here we illustrate the advantage of utilizing a lifted polyhedral approximation, resulting in a tighter polyhedral approximation. The tighter approximation can greatly improve the performance of solvers based on polyhedral approximations, and the benefits are demonstrated by a numerical comparison.
Original languageUndefined/Unknown
Title of host publicationProceedings of the XIII Global Optimization Workshop, GOW'16, 4-8 September 2016
EditorsAna Maria A. C. Rocha, M. Fernanda P. Costa, Edite M. G. P. Fernandes
PublisherUniversidade do minho
Pages117–120
ISBN (Print)978-989-20-6764-3
Publication statusPublished - 2016
MoE publication typeA4 Article in a conference publication
EventGlobal Optimization Workshop - Global Optimization Workshop
Duration: 4 Sep 20168 Sep 2016

Conference

ConferenceGlobal Optimization Workshop
Period04/09/1608/09/16

Cite this