Approximation Algorithm Variants for Convex Multiobjective Optimization Problems
We consider a Benson type algorithm to ‘solve’ convex multiobjective optimization problems in the sense that it generates inner and outer approximations to the Pareto frontier. In each iteration of the algorithm, a Pascoletti-Serafini scalarization is solved for an arbitrary vertex of the current ou...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Gazi University
2020-03-01
|
| Series: | Gazi Üniversitesi Fen Bilimleri Dergisi |
| Subjects: | |
| Online Access: | http://static.dergipark.org.tr/article-download/c130/c44d/c014/5e79d7903b8e0.pdf? |