New Reference-Neighbourhood Scalarization Problem for Multiobjective Integer Programming

Scalarization is a frequently used approach for finding efficient solutions that satisfy the preferences of the Decision Maker (DM) in multicriteria optimization. The applicability of a scalarization problem to solve integer multicriteria problems depends on the possibilities it provides for the dec...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Cybernetics and information technologies : CIT Ročník 13; číslo 1; s. 104 - 114
Hlavní autori: Genova, Krasimira, Kirilov, Leonid, Guljashki, Vasil
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Sofia De Gruyter Brill Sp. z o.o., Paradigm Publishing Services 01.01.2013
Predmet:
Computation
Criteria
Cybernetics
Decision making
Integer programming
Integers
Mathematical models
Optimization
ISSN:1311-9702, 1314-4081
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Scalarization is a frequently used approach for finding efficient solutions that satisfy the preferences of the Decision Maker (DM) in multicriteria optimization. The applicability of a scalarization problem to solve integer multicriteria problems depends on the possibilities it provides for the decrease of the computing complexity in finding optimal solutions of this class of problems. This paper presents a reference-neighbourhood scalarizing problem, possessing properties that make it particularly suitable for solving integer problems. One of the aims set in this development has also been the faster obtaining of desired criteria values, defined by the DM, requiring no additional information by him/her. An illustrative example demonstrates the features of this scalarizing problem.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1311-9702
1314-4081
DOI:10.2478/cait-2013-0010