Abstract
The study of robust bilevel programming problems is a relatively new area of optimization theory. In this work, we investigate a bilevel optimization problem where the upper-level and the lower-level constraints incorporate uncertainty. Reducing the problem into a single-level nonlinear and nonsmooth program, necessary optimality conditions are then developed in terms of Clarke subdifferentials. Our approach consists of using the optimal value reformulation together with a partial calmness condition for the robust counterpart of the initial problem. To aid in the detection of Karush-Kuhn-Tucker (KKT) multipliers, an appropriate nonsmooth Mangasarian-Fromovitz constraint qualification is introduced. There are examples highlighting both our results and the limits of certain past studies.
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.
