Solving convex quadratic bilevel programming problems using an enumeration sequential quadratic programming algorithm

In this paper, we present an original method to solve convex bilevel programming problems in an optimistic approach. Both upper and lower level objective functions are convex and the feasible region is a polyhedron. The enumeration sequential linear programming algorithm uses primal and dual monoton...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of global optimization Jg. 47; H. 4; S. 615 - 637
1. Verfasser:	Etoa, Jean Bosco Etoa
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Boston Springer US 01.08.2010 Springer Nature B.V
Schlagworte:	Algorithms Computer Science Linear programming Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Quadratic programming Real Functions Studies Variables Convex quadratic bilevel program Primal-dual monotonicity Monotonicity network Enumeration sequential quadratic programming algorithm
ISSN:	0925-5001, 1573-2916
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!