Generalized bilevel programming problems

Files

DMS 646.pdf (1.13 MB)

Date

2010-05-25T22:05:32Z

Authors

Ye, J. J.
Zhu, D. L.
Zhu, Q.

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

The generalized bilevel programming problem (GBLP) is a mathematical programming problem with variational inequality constraints. In this paper by error bound approach, we establish some equivalent single level formulation of the generalized bilevel programming problem. The necessary optimality condition of Kuhn-Tucker type are then given by using nonsmooth analysis.

Description

Keywords

generalized bilevel programming problems, variational inequality, error bound, necessary optimality condition, nonsmooth analysis

Citation

URI

http://hdl.handle.net/1828/2800

Collections

Technical Reports (Mathematics and Statistics)
 
University of Victoria Libraries

We acknowledge and respect the Lək̓ʷəŋən (Songhees and Esquimalt) Peoples on whose territory the university stands, and the Lək̓ʷəŋən and W̱SÁNEĆ Peoples whose historical relationships with the land continue to this day.