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...

Celý popis

Podrobná bibliografie

Vydáno v:	Journal of global optimization Ročník 47; číslo 4; s. 615 - 637
Hlavní autor:	Etoa, Jean Bosco Etoa
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Boston Springer US 01.08.2010 Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!