Iterative Solution Process for Multiple Objective Stochastic Linear Programming Problems Under Fuzzy Environment
This article presents one interactive algorithm, and thereby determines the Pareto optimal solution to multi-objective stochastic linear programming (MOSLP) problems in real-life oriented fuzzy environment. Among the various objective functions, there always exists one objective function, referred t...
Uložené v:
| Vydané v: | Fuzzy information and engineering Ročník 10; číslo 4; s. 435 - 451 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Abingdon
Taylor & Francis
02.10.2018
Taylor & Francis Group |
| Predmet: | |
| ISSN: | 1616-8658, 1616-8666 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | This article presents one interactive algorithm, and thereby determines the Pareto optimal solution to multi-objective stochastic linear programming (MOSLP) problems in real-life oriented fuzzy environment. Among the various objective functions, there always exists one objective function, referred to as the main objective function in this article, to multi-objective models, whose optimal value is most vital to decision-makers. When the optimal value to main objective function meets the pre-determined aspiration level, and the corresponding values to other objective functions are satisfactory in nature, that Pareto optimal solution is acceptable to decision-makers. Again, in several existing interactive fuzzy optimisation methods to MOSLP models, all reference membership levels of expectations to objective functions are considered as a unity. However, this seems to be less rational that the expectation of each conflicting objective function simultaneously attains the individual goal. So, the present article proposes to employ the trade-off ratios of membership functions to analytically determine reference membership levels in a fuzzy environment. Numerical applications further illustrate this algorithm. Finally, conclusions are drawn. |
|---|---|
| Bibliografia: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 1616-8658 1616-8666 |
| DOI: | 10.1080/16168658.2020.1750871 |