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

No Thumbnail Available



Journal Title

Journal ISSN

Volume Title


Addis Ababa University


Today, 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.



Systematic Global, Optimization Algorithm, General Multilevel Multi Follower, Stackelberg Nash Problems, Bounded Decision Range