A computationally efficient algorithm to approximate the Pareto front of multi-objective linear fractional programming problem
Year of publication: |
2019
|
---|---|
Authors: | Stanojević, Bogdana ; Stanojević, Milan |
Published in: |
RAIRO / Operations research. - Les Ulis : EDP Sciences, ISSN 0399-0559, ZDB-ID 1481534-5. - Vol. 53.2019, 4, p. 1229-1244
|
Subject: | Fractional programming | multiple objective programming | efficient solution | non-dominated point | 0th order approximation | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Algorithmus | Algorithm | Nichtlineare Optimierung | Nonlinear programming | Multikriterielle Entscheidungsanalyse | Multi-criteria analysis |
-
Maleknia, Morteza, (2024)
-
A decision space algorithm for multiobjective convex quadratic integer optimization
De Santis, Marianna, (2021)
-
Kim, Do Sang, (2018)
- More ...
-
On the cardinality of the nondominated set of multi-objective combinatorial optimization problems
Stanojević, Milan, (2013)
-
On the cardinality of the nondominated set of multi-objective combinatorial optimization problems
Stanojević, Milan, (2013)
-
Stanojević, Bogdana, (2016)
- More ...