메뉴 건너뛰기




Volumn 42, Issue 4, 2008, Pages 475-513

Global solution of bilevel programs with a nonconvex inner program

Author keywords

Bilevel program; Branch and bound; Global optimization; MPEC; Nonconvex

Indexed keywords

BOOLEAN FUNCTIONS; CONTROL THEORY; CONVERGENCE OF NUMERICAL METHODS; GLOBAL OPTIMIZATION; HEURISTIC METHODS; PROBABILITY DENSITY FUNCTION;

EID: 54949083549     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-007-9260-z     Document Type: Article
Times cited : (125)

References (55)
  • 1
    • 0034276022 scopus 로고    scopus 로고
    • Interval analysis: Theory and applications
    • 1-2
    • G. Alefeld G. Mayer 2000 Interval analysis: theory and applications J. Comput. Appl. Math. 121 1-2 421 464
    • (2000) J. Comput. Appl. Math. , vol.121 , pp. 421-464
    • Alefeld, G.1    Mayer, G.2
  • 3
    • 0020749167 scopus 로고
    • An algorithm for solving the general bilevel programming problem
    • 2
    • J.F. Bard 1983 An algorithm for solving the general bilevel programming problem Math. Oper. Res. 8 2 260 272
    • (1983) Math. Oper. Res. , vol.8 , pp. 260-272
    • Bard, J.F.1
  • 5
    • 0003713964 scopus 로고    scopus 로고
    • 2 Athena Scientific, Belmont Massachusetts
    • Bertsekas D.P. (1999). Nonlinear Programming, 2nd edn. Athena Scientific, Belmont, Massachusetts
    • (1999) Nonlinear Programming
    • Bertsekas, D.P.1
  • 9
    • 0016961896 scopus 로고
    • Infinitely constrained optimization problems. J. Optim
    • 2
    • J.W. Blankenship J.E. Falk 1976 Infinitely constrained optimization problems. J. Optim Theory Appl. 19 2 261 281
    • (1976) Theory Appl. , vol.19 , pp. 261-281
    • Blankenship, J.W.1    Falk, J.E.2
  • 10
    • 0009403492 scopus 로고
    • Mathematical programs with optimization problems in constraints
    • 1
    • J. Bracken J.T. [tmp] McGill 1973 Mathematical programs with optimization problems in constraints Oper. Res. 21 1 37 44
    • (1973) Oper. Res. , vol.21 , pp. 37-44
    • Bracken, J.1    McGill, J.T.2
  • 12
    • 0041635345 scopus 로고
    • Generating linear and linear-quadratic bilevel programming-problems
    • 4
    • P.H. Calamai L.N. Vicente 1993 Generating linear and linear-quadratic bilevel programming-problems SIAM J. Sci. Comput. 14 4 770 782
    • (1993) SIAM J. Sci. Comput. , vol.14 , pp. 770-782
    • Calamai, P.H.1    Vicente, L.N.2
  • 13
    • 0028388230 scopus 로고
    • Generating quadratic bilevel programming test problems
    • 1
    • P.H. Calamai L.N. Vicente 1994 Generating quadratic bilevel programming test problems ACM Trans. Math. Software 20 1 103 119
    • (1994) ACM Trans. Math. Software , vol.20 , pp. 103-119
    • Calamai, P.H.1    Vicente, L.N.2
  • 14
    • 34250073829 scopus 로고
    • A new technique for generating quadratic-programming test problems. Math
    • 2
    • P.H. Calamai L.N. Vicente J.J. Judice 1993 A new technique for generating quadratic-programming test problems. Math Program. 61 2 215 231
    • (1993) Program. , vol.61 , pp. 215-231
    • Calamai, P.H.1    Vicente, L.N.2    Judice, J.J.3
  • 15
    • 0042637225 scopus 로고    scopus 로고
    • Technical Report CRT-2002-38. Technical Report, Centre de Recherche sur les Transports, Université de Montréal, Montréal, QC, Canada
    • Colson, B.: BIPA (Bilevel programming with approximation methods): Software guide and test problems, Technical Report CRT-2002-38. Technical Report, Centre de Recherche sur les Transports, Université de Montréal, Montréal, QC, Canada (2002)
    • (2002) BIPA (Bilevel Programming with Approximation Methods): Software Guide and Test Problems
    • Colson, B.1
  • 16
    • 24044516145 scopus 로고    scopus 로고
    • A trust-region method for nonlinear bilevel programming: Algorithm and computational experience. Comput
    • 3
    • B. Colson P. Marcotte G. Savard 2005 A trust-region method for nonlinear bilevel programming: Algorithm and computational experience. Comput Optim. Appl. 30 3 211 227
    • (2005) Optim. Appl. , vol.30 , pp. 211-227
    • Colson, B.1    Marcotte, P.2    Savard, G.3
  • 18
    • 0042737841 scopus 로고    scopus 로고
    • Annotated bibliography on bilevel programming and mathematical programs with equilibrium constraints
    • 3
    • S. Dempe 2003 Annotated bibliography on bilevel programming and mathematical programs with equilibrium constraints Optimization 52 3 333 359
    • (2003) Optimization , vol.52 , pp. 333-359
    • Dempe, S.1
  • 19
    • 0025841206 scopus 로고
    • Algorithms for nonlinear bilevel mathematical programs
    • 1
    • T.A. Edmunds J.F. Bard 1991 Algorithms for nonlinear bilevel mathematical programs IEEE Trans. Syst. Man Cybernet. 21 1 83 89
    • (1991) IEEE Trans. Syst. Man Cybernet. , vol.21 , pp. 83-89
    • Edmunds, T.A.1    Bard, J.F.2
  • 20
  • 21
    • 0002423523 scopus 로고
    • On bilevel programming, part I: General nonlinear cases
    • 1
    • J.E. Falk J.M. Liu 1995 On bilevel programming, part I: general nonlinear cases Math.Program. 70 1 47 72
    • (1995) Math.Program. , vol.70 , pp. 47-72
    • Falk, J.E.1    Liu, J.M.2
  • 22
    • 0035802290 scopus 로고    scopus 로고
    • Global optimization in design under uncertainty: Feasibility test and flexibility index problems
    • 20
    • C.A. Floudas Z.H. Gümüs M.G. Ierapetritou 2001 Global optimization in design under uncertainty: feasibility test and flexibility index problems Indust. Eng. Chem. Res. 40 20 4267 4282
    • (2001) Indust. Eng. Chem. Res. , vol.40 , pp. 4267-4282
    • Floudas, C.A.1    Gümüs, Z.H.2    Ierapetritou, M.G.3
  • 23
    • 54949122903 scopus 로고    scopus 로고
    • The adaptive convexification algorithm: A feasible point method for semi-infinite programming
    • 4
    • C.A. Floudas O. Stein 2007 The adaptive convexification algorithm: a feasible point method for semi-infinite programming SIAM J. Optim. 18 4 1187 1208
    • (2007) SIAM J. Optim. , vol.18 , pp. 1187-1208
    • Floudas, C.A.1    Stein, O.2
  • 24
    • 0019608634 scopus 로고
    • A representation and economic interpretation of a two-level programming problem
    • 9
    • J. Fortuny-Amat B. [tmp] McCarl 1981 A representation and economic interpretation of a two-level programming problem J. Oper. Res. Soc. 32 9 783 792
    • (1981) J. Oper. Res. Soc. , vol.32 , pp. 783-792
    • Fortuny-Amat, J.1    McCarl, B.2
  • 25
    • 0016619730 scopus 로고
    • Improved linear integer programming formulations of nonlinear integer programs. Manag
    • 4
    • F. Glover 1975 Improved linear integer programming formulations of nonlinear integer programs. Manag Sci. 22 4 455 460
    • (1975) Sci. , vol.22 , pp. 455-460
    • Glover, F.1
  • 26
    • 0141664156 scopus 로고    scopus 로고
    • Review of nonlinear mixed-integer and disjunctive programming techniques
    • 3
    • I.E. Grossmann 2002 Review of nonlinear mixed-integer and disjunctive programming techniques Optim. Eng. 3 3 227 252
    • (2002) Optim. Eng. , vol.3 , pp. 227-252
    • Grossmann, I.E.1
  • 27
    • 0020152797 scopus 로고
    • Decomposition strategy for designing flexible chemical-plants
    • 4
    • I.E. Grossmann K.P. Halemane 1982 Decomposition strategy for designing flexible chemical-plants AIChE J. 28 4 686 694
    • (1982) AIChE J. , vol.28 , pp. 686-694
    • Grossmann, I.E.1    Halemane, K.P.2
  • 28
    • 0035332163 scopus 로고    scopus 로고
    • Global optimization of nonlinear bilevel programming problems
    • 1
    • Z.H. Gümüs C.A. Floudas 2001 Global optimization of nonlinear bilevel programming problems J. Glob. Optim. 20 1 1 31
    • (2001) J. Glob. Optim. , vol.20 , pp. 1-31
    • Gümüs, Z.H.1    Floudas, C.A.2
  • 29
    • 0024035604 scopus 로고
    • Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reverse convex constraints, DC-programming, and Lipschitzian optimization
    • 1
    • R. Horst 1988 Deterministic global optimization with partition sets whose feasibility is not known: application to concave minimization, reverse convex constraints, DC-programming, and Lipschitzian optimization J. Optim. Theo Appl. 58 1 11 37
    • (1988) J. Optim. Theo Appl. , vol.58 , pp. 11-37
    • Horst, R.1
  • 31
    • 18244364780 scopus 로고    scopus 로고
    • Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs
    • 3
    • P. Kesavan R.J. Allgor E.P. Gatzke P.I. Barton 2004 Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs Math. Program. 100 3 517 535
    • (2004) Math. Program. , vol.100 , pp. 517-535
    • Kesavan, P.1    Allgor, R.J.2    Gatzke, E.P.3    Barton, P.I.4
  • 32
    • 0034661245 scopus 로고    scopus 로고
    • Generalized branch-and-cut framework for mixed-integer nonlinear optimization problems
    • 2-7
    • P. Kesavan P.I. Barton 2000 Generalized branch-and-cut framework for mixed-integer nonlinear optimization problems Comput. Chem. Eng. 24 2-7 1361 1366
    • (2000) Comput. Chem. Eng. , vol.24 , pp. 1361-1366
    • Kesavan, P.1    Barton, P.I.2
  • 37
    • 54949152590 scopus 로고    scopus 로고
    • Technical Report, Massachusetts Institute of Technology
    • Mitsos, A., Barton, P.I.: A test set for bilevel programs, http://yoric.mit.edu/download/Reports/bileveltestset.pdf. Technical Report, Massachusetts Institute of Technology (2006)
    • (2006) A Test Set for Bilevel Programs
    • Mitsos, A.1    Barton, P.I.2
  • 39
    • 0025488373 scopus 로고
    • The mixed integer linear bilevel programming problem
    • 5
    • J.T. Moore J.F. Bard 1990 The mixed integer linear bilevel programming problem Oper. Res. 38 5 911 921
    • (1990) Oper. Res. , vol.38 , pp. 911-921
    • Moore, J.T.1    Bard, J.F.2
  • 43
    • 0032535845 scopus 로고    scopus 로고
    • A dual temperature simulated annealing approach for solving bilevel programming problems
    • 1
    • K.H. Sahin A.R. Ciric 1998 A dual temperature simulated annealing approach for solving bilevel programming problems Comput. Chem Eng. 23 1 11 25
    • (1998) Comput. Chem Eng. , vol.23 , pp. 11-25
    • Sahin, K.H.1    Ciric, A.R.2
  • 46
    • 3543047371 scopus 로고    scopus 로고
    • Continuous reformulations of discrete-continuous optimization problems
    • 10
    • O. Stein J. Oldenburg W. Marquardt 2004 Continuous reformulations of discrete-continuous optimization problems Comput. Chem. Eng. 28 10 1951 1966
    • (2004) Comput. Chem. Eng. , vol.28 , pp. 1951-1966
    • Stein, O.1    Oldenburg, J.2    Marquardt, W.3
  • 47
    • 1642417653 scopus 로고    scopus 로고
    • Solving semi-infinite optimization problems with interior point techniques
    • 3
    • O. Stein G. Still 2003 Solving semi-infinite optimization problems with interior point techniques SIAM J. Control Optim. 42 3 769 788
    • (2003) SIAM J. Control Optim. , vol.42 , pp. 769-788
    • Stein, O.1    Still, G.2
  • 49
    • 0034083394 scopus 로고    scopus 로고
    • DAEPACK: An open modeling environment for legacy models
    • 6
    • J. Tolsma P.I. Barton 2000 DAEPACK: an open modeling environment for legacy models Indust. Eng. Chem. Res. 39 6 1826 1839
    • (2000) Indust. Eng. Chem. Res. , vol.39 , pp. 1826-1839
    • Tolsma, J.1    Barton, P.I.2
  • 50
    • 34250845890 scopus 로고    scopus 로고
    • A novel approach to bilevel nonlinear programming
    • 4
    • H. Tuy A. Migdalas N.T. Hoai-Phuong 2007 A novel approach to bilevel nonlinear programming J. Glob. Optim. 38 4 527 554
    • (2007) J. Glob. Optim. , vol.38 , pp. 527-554
    • Tuy, H.1    Migdalas, A.2    Hoai-Phuong, N.T.3
  • 51
    • 0001915878 scopus 로고
    • A global optimization approach for the linear 2-level program
    • 1
    • H. Tuy A. Migdalas P. Varbrand 1993 A global optimization approach for the linear 2-level program J. Glob. Optim. 3 1 1 23
    • (1993) J. Glob. Optim. , vol.3 , pp. 1-23
    • Tuy, H.1    Migdalas, A.2    Varbrand, P.3
  • 52
    • 0041635229 scopus 로고
    • A quasi-concave minimization method for solving linear 2-level programs
    • 3
    • H. Tuy A. Migdalas P. Varbrand 1994 A quasi-concave minimization method for solving linear 2-level programs J. Glob. Optim. 4 3 243 263
    • (1994) J. Glob. Optim. , vol.4 , pp. 243-263
    • Tuy, H.1    Migdalas, A.2    Varbrand, P.3
  • 53
    • 0000527046 scopus 로고
    • Bilevel and multilevel programming - A bibliography review
    • 3
    • L.N. Vicente P.H. Calamai 1994 Bilevel and multilevel programming - A bibliography review J. Glob. Optim. 5 3 291 306
    • (1994) J. Glob. Optim. , vol.5 , pp. 291-306
    • Vicente, L.N.1    Calamai, P.H.2
  • 55
    • 2842536882 scopus 로고
    • Solving minimax problems by interval-methods
    • 4
    • S. Zuhe A. Neumaier M.C. Eiermann 1990 Solving minimax problems by interval-methods BIT 30 4 742 751
    • (1990) BIT , vol.30 , pp. 742-751
    • Zuhe, S.1    Neumaier, A.2    Eiermann, M.C.3


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