Constraint Qualifications and Optimality Conditions in Bilevel Optimization

Jane J. Ye ()
Additional contact information
Jane J. Ye: University of Victoria

Chapter Chapter 8 in Bilevel Optimization, 2020, pp 227-251 from Springer

Abstract: Abstract In this paper we study constraint qualifications and optimality conditions for bilevel programming problems. We strive to derive checkable constraint qualifications in terms of problem data and applicable optimality conditions. For the bilevel program with convex lower level program we discuss drawbacks of reformulating a bilevel programming problem by the mathematical program with complementarity constraints and present a new sharp necessary optimality condition for the reformulation by the mathematical program with a generalized equation constraint. For the bilevel program with a nonconvex lower level program we propose a relaxed constant positive linear dependence (RCPLD) condition for the combined program.

Keywords: Bilevel programs; Necessary optimality conditions; Constraint qualifications (search for similar items in EconPapers)
Date: 2020
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-030-52119-6_8

Ordering information: This item can be ordered from
http://www.springer.com/9783030521196

DOI: 10.1007/978-3-030-52119-6_8

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().