Which efficient solution in multi objective programming problem should be taken?

In practical problems, which can be stated in the form of multi objective programming problem, we have usually a large set of efficient solutions. So, which solution from this set should be taken, appears as a natural question here. In the paper we propose some sustainable principles and simple nume...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Central European journal of operations research Ročník 29; číslo 3; s. 967 - 987
Hlavní autori: Matejas, Josip, Peric, Tunjo, Mlinaric, Danijel
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.09.2021
Springer
Springer Nature B.V
Predmet:
ISSN:1435-246X, 1613-9178
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In practical problems, which can be stated in the form of multi objective programming problem, we have usually a large set of efficient solutions. So, which solution from this set should be taken, appears as a natural question here. In the paper we propose some sustainable principles and simple numerical method for such choice. The method respects aspirations and priorities of decision makers and enables iterations for possible improvement of the solution. In this way decision makers can clearly understand why a particular solution is obtained and when and how it can be improved. The features of the method are explained by a practical example. An applications to bilevel programming problems are also presented, where the both side mapping, between the set of efficient solutions and the set of all possible priorities, is shown. It is illustrated in detail through several linear and nonlinear examples.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1435-246X
1613-9178
DOI:10.1007/s10100-020-00718-1