PL EN


Preferences help
enabled [disable] Abstract
Number of results
2012 | 21 |
Article title

Combined Reformulation of Bilevel Programming Problems

Authors
Content
Title variants
Languages of publication
PL
Abstracts
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.
Publisher
Year
Volume
21
Physical description
Dates
published
2012
online
21 - 05 - 2015
Contributors
author
References
Document Type
Publication order reference
Identifiers
YADDA identifier
bwmeta1.element.ojs-issn-2083-8476-year-2012-volume-21-article-2214
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.