Systematic Global Optimization Algorithm For A General Multilevel Multi Follower Stackelberg Nash Problems With Bounded Decision Range

Today, many decision makers decide a decision which is hard to accept andrncould affect or leave to unpleasant situation to those who follows them in structuralrnarrangements. This is because of challenge of solving Structural multi levelrninterdependent set of objects. And most of computational model has challenge forrnfinding the optimal result of each object that considerer all the constraints andrnlimitations of each decision maker in both computational time and decision supportrnquality. This thesis develops a computational optimization computerized model basedrnon root finding technique for a bounded decision range in a non-cooperativernenvironment to reduce computational time and improve decision support quality.

Get Full Work

Report copyright infringement or plagiarism