Nonlinear bi-objective optimization: Improving the upper envelope using feasible line segments

Damir Aliquintui, IGNACIO DANIEL ARAYA ZAMORANO, Franco Ardiles, Braulio Lobo

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

1 Scopus citations

Abstract

In this work we propose a segment-based representation for the upper bound of the non-dominated set in interval branch & bound solvers for bi-objective non linear optimization. We also warranty that every point over the upper segments is dominated by at least one point in the feasible objective region. Segments are generated by linear envelopes of the image of feasible line-segments. The segment-based representation allows us to converge more quickly to the desired precision of the whole strategy.

Original languageEnglish
Title of host publicationProceedings LeGO 2018 � 14th International Global Optimization Workshop
EditorsAndre H. Deutz, Sander C. Hille, Yaroslav D. Sergeyev, Michael T. M. Emmerich
PublisherAmerican Institute of Physics Inc.
ISBN (Electronic)9780735417984
DOIs
StatePublished - 12 Feb 2019
Event14th International Global Optimization Workshop, LeGO 2018 - Leiden, Netherlands
Duration: 18 Sep 201821 Sep 2018

Publication series

NameAIP Conference Proceedings
Volume2070
ISSN (Print)0094-243X
ISSN (Electronic)1551-7616

Conference

Conference14th International Global Optimization Workshop, LeGO 2018
CountryNetherlands
CityLeiden
Period18/09/1821/09/18

Fingerprint Dive into the research topics of 'Nonlinear bi-objective optimization: Improving the upper envelope using feasible line segments'. Together they form a unique fingerprint.

Cite this