Name
Abstract | ||
|---|---|---|
We propose a method for finding a global solution of a class of nonlinear bilevel programs, in which the objective function in the first level is a DC function, and the second level consists of finding a Karush-Kuhn-Tucker point of a quadratic programming problem. This method is a combination of the local algorithm DCA in DC programming with a branch and bound scheme well known in discrete and global optimization. Computational results on a class of quadratic bilevel programs are reported. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/s10898-008-9325-7 | J. Global Optimization |
Keywords | Field | DocType |
Bilevel programming,Nonconvex programming,DC programming,DCA,Global optimization,Branch and bound techniques | Branch and bound,Mathematical optimization,Bilevel optimization,Global optimization,Branch and price,Quadratic equation,Local algorithm,Quadratic programming,Sequential quadratic programming,Mathematics | Journal |
Volume | Issue | ISSN |
44 | 3 | 0925-5001 |
Citations | PageRank | References |
7 | 0.49 | 13 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Le Thi Hoai An | 1 | 1038 | 80.20 |
| Pham Dinh Tao | 2 | 1340 | 104.84 |
| Nam Nguyen Canh | 3 | 27 | 1.28 |
| Nguyen Thoai | 4 | 7 | 0.49 |