Author： Etoa Jean
Publisher： Springer Publishing Company
ISSN： 0925-5001
Source： Journal of Global Optimization, Vol.47, Iss.4, 2010-08, pp. : 615-637
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
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 monotonicity properties of the primal and dual lower level objective functions and constraints within an enumeration frame work. New optimality conditions are given, expressed in terms of tightness of the constraints of lower level problem. These optimality conditions are used at each step of our algorithm to compute an improving rational solution within some indexes of lower level primal-dual variables and monotonicity networks as well. Some preliminary computational results are reported.
Related content
Access to resources
Recommend
Designing Camera Networks by Convex Quadratic Programming
COMPUTER GRAPHICS FORUM (ELECTRONIC), Vol. 34, Iss. 2, 2015-05 ,pp. :