An extended Kuhn–Tucker approach for linear bilevel programming

Kuhn–Tucker approach has been applied with remarkable success in linear bilevel programming (BLP). However, it still has some extent unsatisfactory and incomplete. One principle challenges is that it could not well handle a linear BLP problem when the constraint functions at the upper-level are of a...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Applied mathematics and computation Jg. 162; H. 1; S. 51 - 63
Hauptverfasser:	Shi, Chenggen, Lu, Jie, Zhang, Guangquan
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York, NY Elsevier Inc 04.03.2005 Elsevier
Schlagworte:	Calculus of variations and optimal control Decision-making Exact sciences and technology Global analysis, analysis on manifolds Kuhn–Tucker conditions Linear bilevel programming Mathematical analysis Mathematics Numerical analysis Numerical analysis. Scientific computation Numerical methods in mathematical programming, optimization and calculus of variations Optimization Sciences and techniques of general use Topology. Manifolds and cell complexes. Global analysis and analysis on manifolds Von Stackelberg game Kuhn–Tucker conditions Decision-making Linear bilevel programming Optimization Von Stackelberg game Numerical analysis Applied mathematics Decision making Optimization method Linear programming Kuhn-Tucker conditions Constrained optimization Mathematical programming
ISSN:	0096-3003, 1873-5649
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!