Full-text resources of PSJD and other databases are now available in the new Library of Science.
Visit https://bibliotekanauki.pl

Refine search results

Journals help

  1. 1 Schedae Informaticae

Years help

  1. 1 2012

Authors help

  1. 1 Pilecka M.

Preferences help
Polish version English version Language
enabled [disable] Abstract
Number of results

Results found: 1

Number of results on page
first rewind previous Page / 1 next fast forward last

Search results

Search:
in the keywords:  bilevel programming, value function reformulation, KKT reformulation, constraint qualifications, optimality conditions
help Sort By:

help Limit search:
first rewind previous Page / 1 next fast forward last
1
Publication available in full text mode
Content available

Combined Reformulation of Bilevel Programming Problems

100%
Pilecka M.
|
|
vol. 21
PL
In J. J. Ye and D. L. Zhu proposed a new reformulation of a bilevel programming problem which compounds the value function and KKT approaches. In partial calmness condition was also adapted to this new reformulation and optimality conditions using partial calmness were introduced. In this paper we investigate above all local equivalence of the combined reformulation and the initial problem and how constraint qualifications and optimality conditions could be defined for this reformulation without using partial calmness. Since the optimal value function is in general nondifferentiable and KKT constraints have MPEC-structure, the combined reformulation is a nonsmooth MPEC. This special structure allows us to adapt some constraint qualifications and necessary optimality conditions from MPEC theory using disjunctive form of the combined reformulation. An example shows, that some of the proposed constraint qualifications can be fulfilled.
first rewind previous Page / 1 next fast forward last
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.