Systematic Global Optimization Algorithm for a General Multilevel Multi Follower Stackelberg Nash Problems with Bounded Decision Range

Simple item page
dc.contributor.advisorGoa, Mengistu
dc.contributor.authorDagne, Yonas
dc.date.accessioned2022-01-24T10:49:24Z
dc.date.accessioned2023-11-18T09:51:16Z
dc.date.available2022-01-24T10:49:24Z
dc.date.available2023-11-18T09:51:16Z
dc.date.issued2018-06-12
dc.description.abstractToday, many decision makers decide a decision which is hard to accept and could affect or leave to unpleasant situation to those who follows them in structural arrangements. This is because of challenge of solving Structural multi level interdependent set of objects. And most of computational model has challenge for finding the optimal result of each object that considerer all the constraints and limitations of each decision maker in both computational time and decision support quality. This thesis develops a computational optimization computerized model based on root finding technique for a bounded decision range in a non-cooperative environment to reduce computational time and improve decision support quality.en_US
dc.identifier.urihttp://etd.aau.edu.et/handle/12345678/29593
dc.language.isoenen_US
dc.publisherAddis Ababa Universityen_US
dc.subjectSystematic Globalen_US
dc.subjectOptimization Algorithmen_US
dc.subjectGeneral Multilevel Multi Followeren_US
dc.subjectStackelberg Nash Problemsen_US
dc.subjectBounded Decision Rangeen_US
dc.titleSystematic Global Optimization Algorithm for a General Multilevel Multi Follower Stackelberg Nash Problems with Bounded Decision Rangeen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Yonas Dagne 2018.pdf
Size:
480.57 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Plain Text
Description:
Download

Collections

Computational Science