Advanced Search
Article Contents
Article Contents

Global optimization algorithm for solving bilevel programming problems with quadratic lower levels

Abstract Related Papers Cited by
  • In this article, we propose a method for finding the global optimum of a class of nonlinear bilevel programming problems. The main idea of this method is to construct iteratively a sequence of points either ending at an optimal solution of the equivalent problem with a complementarity constraint, or converging to an optimal solution. The construction of such a sequence is performed by using a branch-and-bound scheme, together with some relaxation techniques, which are successfully applied in global optimization. Some illustrative examples and results on computational experiments are reported.
    Mathematics Subject Classification: Primary: 90C26; Secondary: 91A05.


    \begin{equation} \\ \end{equation}
  • 加载中

Article Metrics

HTML views() PDF downloads(91) Cited by(0)

Access History

Other Articles By Authors



    DownLoad:  Full-Size Img  PowerPoint