메뉴 건너뛰기




Volumn 26, Issue 2, 2003, Pages 199-219

A global optimization method for solving convex quadratic bilevel programming problems

Author keywords

Branch and bound algorithm; Convex quadratic bilevel programming; Merit function; Optimization over an equilibrium set; Saddle function

Indexed keywords


EID: 84867948361     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1023/A:1023047900333     Document Type: Article
Times cited : (66)

References (29)
  • 3
    • 0019937742 scopus 로고
    • An explicit solution in the multilevel programming problem
    • J.F. Bard J.F. Falk 1982 An explicit solution in the multilevel programming problem Computers and Operations Research 9 77 100
    • (1982) Computers and Operations Research , vol.9 , pp. 77-100
    • Bard, J.F.1    Falk, J.F.2
  • 4
    • 0023843286 scopus 로고
    • Convex two-level optimization
    • J.F. Bard 1988 Convex two-level optimization Mathematical Programming 40 15 27
    • (1988) Mathematical Programming , vol.40 , pp. 15-27
    • Bard, J.F.1
  • 5
    • 0020749167 scopus 로고
    • An algorithm for solving the general bilevel programming problem
    • J.F. Bard 1983 An algorithm for solving the general bilevel programming problem Mathematics of Operations Research 8 260 272
    • (1983) Mathematics of Operations Research , vol.8 , pp. 260-272
    • Bard, J.F.1
  • 10
    • 0000008666 scopus 로고
    • A necessary and sufficient optimality condition for bilevel programming problem
    • S. Dempe 1992 A necessary and sufficient optimality condition for bilevel programming problem Optimization 25 341 354
    • (1992) Optimization , vol.25 , pp. 341-354
    • Dempe, S.1
  • 11
    • 0002423523 scopus 로고
    • On bilevel programming: Part 1: General nonlinear cases
    • J. Falk J. Liu 1995 On bilevel programming: Part 1: General nonlinear cases Mathematical Programming 70 47 72
    • (1995) Mathematical Programming , vol.70 , pp. 47-72
    • Falk, J.1    Liu, J.2
  • 12
    • 0030303859 scopus 로고    scopus 로고
    • A new merit function and a successive quadratic programming algorithm for variational inequalities problems
    • M. Fukushima 1996 A new merit function and a successive quadratic programming algorithm for variational inequalities problems SIAM Journal Optimization 6 703 713
    • (1996) SIAM Journal Optimization , vol.6 , pp. 703-713
    • Fukushima, M.1
  • 16
  • 17
    • 33645434196 scopus 로고
    • A sequencial LCP method for bilevel linear programming
    • J. Judice A.M. Faustino 1992 A sequencial LCP method for bilevel linear programming Annals of Operations Research 34 89 106
    • (1992) Annals of Operations Research , vol.34 , pp. 89-106
    • Judice, J.1    Faustino, A.M.2
  • 19
    • 0010087082 scopus 로고
    • Bilevel programming in traffic planning models: Methods and challenge
    • A. Migdalas 1995 Bilevel programming in traffic planning models: Methods and challenge Journal of Global Optimization 7 381 405
    • (1995) Journal of Global Optimization , vol.7 , pp. 381-405
    • Migdalas, A.1
  • 20
    • 0003496903 scopus 로고    scopus 로고
    • A. Migdalas P. Pardalos P. Värbrand (eds). Kluwer Academic Publishers Dordrecht
    • Migdalas, A., Pardalos, P. and Värbrand, P., (eds.) (1998), Multilevel Optimization: Algorithms and Applications, Kluwer Academic Publishers, Dordrecht.
    • (1998) Multilevel Optimization: Algorithms and Applications
  • 21
    • 34250075473 scopus 로고
    • An algorithm for solving convex programs with an additional convexconcave constraint
    • L.D. Muu 1993 An algorithm for solving convex programs with an additional convexconcave constraint Mathematical Programming 61 75 87
    • (1993) Mathematical Programming , vol.61 , pp. 75-87
    • Muu, L.D.1
  • 22
    • 0042136178 scopus 로고    scopus 로고
    • On the construction of initial polyhedral convex set for optimization problem over the efficient set and bilevel linear program
    • L.D. Muu 2000 On the construction of initial polyhedral convex set for optimization problem over the efficient set and bilevel linear program Vietnam Journal of Mathematics 28 177 182
    • (2000) Vietnam Journal of Mathematics , vol.28 , pp. 177-182
    • Muu, L.D.1
  • 23
    • 0041635258 scopus 로고    scopus 로고
    • Optimization over an equilibrium sets
    • L.D. Muu W. Oettli 2001 Optimization over an equilibrium sets Optimization 49 179 189
    • (2001) Optimization , vol.49 , pp. 179-189
    • Muu, L.D.1    Oettli, W.2
  • 24
    • 84867982904 scopus 로고    scopus 로고
    • On penalty function method for a class of nonconvex constrained optimization problems
    • N.V. Quy L.D. Muu 2001 On penalty function method for a class of nonconvex constrained optimization problems Vietnam Journal of Mathematics 29 235 256
    • (2001) Vietnam Journal of Mathematics , vol.29 , pp. 235-256
    • Quy, N.V.1    Muu, L.D.2
  • 25
    • 0028444316 scopus 로고
    • The steepest descent direction for the nonlinear bilevel programming problems
    • G. Savard J. Gauvin 1994 The steepest descent direction for the nonlinear bilevel programming problems Operations Research Letters 15 265 272
    • (1994) Operations Research Letters , vol.15 , pp. 265-272
    • Savard, G.1    Gauvin, J.2
  • 27
    • 0041635229 scopus 로고
    • A quasiconcave minimization method for solving linear two-level programs
    • H. Tuy A. Migdalas P. Värbrand 1994 A quasiconcave minimization method for solving linear two-level programs Journal of Global Optimization 4 243 263
    • (1994) Journal of Global Optimization , vol.4 , pp. 243-263
    • Tuy, H.1    Migdalas, A.2    Värbrand, P.3
  • 29
    • 0000138482 scopus 로고
    • A penalty function approach for solving bilevel linear program
    • D.J. White G. Anandalingam 1993 A penalty function approach for solving bilevel linear program Journal of Global Optimization 3 397 419
    • (1993) Journal of Global Optimization , vol.3 , pp. 397-419
    • White, D.J.1    Anandalingam, G.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.