Uncertain Multi -Objective Multi -Item Four Dimensional Fractional Transportation Model
Furthermore, all the uncertain linear fractional objective functions of the proposed model are converted to a single objective function and obtained an optimal solution for the proposed model. NuranGuzel[8],by solving non-linear fraction with single objective function, as proposed by Dinklbach(1967)...
Gespeichert in:
| Veröffentlicht in: | Annals of the Romanian society for cell biology Jg. 25; H. 4; S. 231 - 249 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Arad
"Vasile Goldis" Western University Arad, Romania
01.01.2021
|
| Schlagworte: | |
| ISSN: | 2067-3019, 2067-8282 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | Furthermore, all the uncertain linear fractional objective functions of the proposed model are converted to a single objective function and obtained an optimal solution for the proposed model. NuranGuzel[8],by solving non-linear fraction with single objective function, as proposed by Dinklbach(1967)[9],developed the solution to multi-objective linear fractional programming problem[MOLFPP].When we consider multiple objectives and products in a four dimensional fractional transportation problem[4DFTP] it becomes four dimensional multi-objective multi-item fractional transportation problems[4DMOMIFTP]. [18]proposed a solving method. Since Zadeh's fuzzy set theory[10] could not handle situations consisting incomplete information, we use uncertainty theory founded by Liu [19] to handle such indeterminacies. All the uncertain linear fractional objective functions of the proposed model are converted to a single objective function by using the method introduced by Dinkelbach[9]and obtained an optimal solution for the proposed model. |
|---|---|
| Bibliographie: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 2067-3019 2067-8282 |