Uncertain Multiobjective Programming and Uncertain Goal Programming

Multiobjective programming, known as multi-criteria or multi-attribute optimization, is the process of simultaneously optimizing two or more conflicting objectives. This paper aims to provide a new multiobjective programming named uncertain multiobjective programming that is a type of multiobjective...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of uncertainty analysis and applications Ročník 3; číslo 1; s. 1 - 8
Hlavní autoři: Liu, Baoding, Chen, Xiaowei
Médium: Journal Article
Jazyk:angličtina
Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 19.08.2015
Springer Nature B.V
Témata:
Computational Intelligence
Crisps
Goal programming
Inverse
Management Science
Mathematical models
Mathematical programming
Mathematics
Mathematics and Statistics
Multiple objective
Operations Research
Operations Research/Decision Theory
Optimization
Uncertainty
Uncertain programming
Multiobjective programming
Uncertainty theory
Goal programming
ISSN:2195-5468, 2195-5468
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Multiobjective programming, known as multi-criteria or multi-attribute optimization, is the process of simultaneously optimizing two or more conflicting objectives. This paper aims to provide a new multiobjective programming named uncertain multiobjective programming that is a type of multiobjective programming involving uncertain variables. Some mathematical properties are also explored. Besides, uncertain goal programming is introduced as a compromise method for solving the uncertain multiobjective programming models. Both the uncertain multiobjective programming model and the uncertain goal programming model are transformed to crisp programming models with the help of the operational law of uncertain variables via inverse uncertainty distributions.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:2195-5468
2195-5468
DOI:10.1186/s40467-015-0036-6