2024
DOI: 10.1007/s00186-024-00870-3
|View full text |Cite
|
Sign up to set email alerts
|

An approximation algorithm for multiobjective mixed-integer convex optimization

Ina Lammel,
Karl-Heinz Küfer,
Philipp Süss

Abstract: In this article we introduce an algorithm that approximates the nondominated sets of multiobjective mixed-integer convex optimization problems. The algorithm constructs an inner and outer approximation of the front exploiting the convexity of the patches for problems with an arbitrary number of criteria. In the algorithm, the problem is decomposed into patches, which are multiobjective convex problems, by fixing the integer assignments. The patch problems are solved using (simplicial) Sandwiching. We identify … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
references
References 33 publications
0
0
0
Order By: Relevance