Abstract
Bilevel optimization problems are referred to as having a nested inner optimization problem as a constraint to a outer optimization problem in the domain of mathematical programming. It is also known as Stackelberg problems in game theory. In the recent past, bilevel optimization problems have received a growing attention because of its relevance in practice applications. However, the hierarchical structure makes these problems difficult to handle and they are commonly optimized with a deterministic setup. With presence of constrains, bilevel optimization problems are considered for finding reliable solutions which are subjected to a possess a minimum reliability requirement under decision variable uncertainties. Definition of reliable bilevel solution, the effect of lower and upper level uncertainties on reliable bilevel solution, development of efficient reliable bilevel evolutionary algorithm, and supporting simulation results on test and engineering design problems amply demonstrate their further use in other practical bilevel problems.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
