메뉴 건너뛰기




Volumn 24, Issue 4-5, 2009, Pages 657-668

The global solver in the LINDO API

Author keywords

Global optimization; LINDOAPI; Mixed integer nonlinear programming; Nonsmooth optimization

Indexed keywords

BRANCHING RULES; COMPUTATIONAL RESULTS; FRONT END; GLOBAL SOLVERS; GLOBALOPTIMUM; INITIAL SOLUTION; LINDOAPI; MIXED INTEGER NONLINEAR PROGRAMMING; MODELLING LANGUAGE; NONCONVEX; NONSMOOTH OPTIMIZATION; SUB-PROBLEMS;

EID: 68949107822     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556780902753221     Document Type: Article
Times cited : (154)

References (20)
  • 1
    • 0008644215 scopus 로고
    • Onthe significance of solving linear programming problems with some integer variables
    • G.B. Dantzig, Onthe significance of solving linear programming problems with some integer variables, Econometrica 28 (1961), pp. 30-44.
    • (1961) Econometrica , vol.28 , pp. 30-44
    • Dantzig, G.B.1
  • 2
    • 0001423319 scopus 로고
    • An algorithm for separable nonconvex programming problems
    • J.E. Falk and R.M. Soland, An algorithm for separable nonconvex programming problems, Manag. Sci. 15 (1969), pp. 550-569.
    • (1969) Manag. Sci , vol.15 , pp. 550-569
    • Falk, J.E.1    Soland, R.M.2
  • 5
    • 9344245047 scopus 로고    scopus 로고
    • GAMS Development Corporation, GAMS Development Corporation, Washington, DC, USA
    • GAMS Development Corporation, GAMS-A User's Guide, GAMS Development Corporation, Washington, DC, USA, 2003.
    • (2003) GAMS-A User's Guide
  • 6
    • 68949100098 scopus 로고    scopus 로고
    • Available at
    • GAMSWorld, Globallib model collection, 2008. Available at http://www.gamsworld.org.
    • (2008) Globallib model collection
  • 7
    • 68949099114 scopus 로고    scopus 로고
    • Available at
    • GAMSWorld, Minlplib model collection, 2008. Available at http://www.gamsworld.org.
    • (2008) Minlplib model collection
  • 8
    • 68949160530 scopus 로고    scopus 로고
    • Available at
    • GAMSWorld, Mpeclib model collection, 2008. Available at http://www.gamsworld.org.
    • (2008) Mpeclib model collection
  • 9
    • 33645637249 scopus 로고    scopus 로고
    • Implementation and testing of a branch-and-bound based method for deterministic global optimization: Operations research applications
    • C. Floudas and P. Pardalos, eds, Kluwer, Dordrecht
    • C. Gau and L. Schrage, Implementation and testing of a branch-and-bound based method for deterministic global optimization: Operations research applications in Frontiers in Global Optimization (Nonconvex Optimization and Its Applications), C. Floudas and P. Pardalos, eds., Kluwer, Dordrecht, 2003, pp. 45-164.
    • (2003) Frontiers in Global Optimization (Nonconvex Optimization and Its Applications) , pp. 45-164
    • Gau, C.1    Schrage, L.2
  • 11
    • 68949160529 scopus 로고    scopus 로고
    • Lindo Systems Inc, Lindo Systems, Inc, Chicago, IL
    • Lindo Systems Inc., What'sBest 5.0 User's Manual, Lindo Systems, Inc., Chicago, IL, 2000.
    • (2000) What'sBest 5.0 User's Manual
  • 12
    • 68949161461 scopus 로고    scopus 로고
    • Lindo Systems Inc, Lindo Systems, Inc, Chicago, IL
    • Lindo Systems Inc., LINDO API User's Manual, Lindo Systems, Inc., Chicago, IL, 2007.
    • (2007) LINDO API User's Manual
  • 13
    • 68949158075 scopus 로고    scopus 로고
    • Lindo Systems Inc, Lindo Systems, Inc, Chicago, IL
    • Lindo Systems Inc., What's Best! 9.0 User's Manual, Lindo Systems, Inc., Chicago, IL, 2007.
    • (2007) What's Best! 9.0 User's Manual
  • 14
    • 68949164418 scopus 로고    scopus 로고
    • Lindo Systems Inc, Lindo Systems, Inc, Chicago, IL
    • Lindo Systems Inc., LINGO User's Manual, Lindo Systems, Inc., Chicago, IL, 2008.
    • (2008) LINGO User's Manual
  • 15
    • 34250381644 scopus 로고
    • Computability of global solutions to factorable nonconvex programs: Part I-Convex underestimating problems
    • G.P. McCormick, Computability of global solutions to factorable nonconvex programs: Part I-Convex underestimating problems, Math. Prog. 10 (1976), pp. 147-175.
    • (1976) Math. Prog , vol.10 , pp. 147-175
    • McCormick, G.P.1
  • 16
    • 0001874070 scopus 로고
    • Quadratic programming with one negative eigenvalue is NP-hard
    • P.M. Pardalos and S.A.Vavasis, Quadratic programming with one negative eigenvalue is NP-hard, J. Global Optim. 1 (1991), pp. 15-22.
    • (1991) J. Global Optim , vol.1 , pp. 15-22
    • Pardalos, P.M.1    Vavasis, S.A.2
  • 18
    • 0000318768 scopus 로고    scopus 로고
    • BARON: A general purpose global optimization software package
    • N. Sahinidis, BARON: A general purpose global optimization software package, J. Global Optim. 8 (1996), pp. 201-205.
    • (1996) J. Global Optim , vol.8 , pp. 201-205
    • Sahinidis, N.1
  • 19
    • 42549162441 scopus 로고    scopus 로고
    • Stochastic mathematical programs with equilibrium constraints, modelling and sample average approximation
    • A. Shapiro and H. Xu, Stochastic mathematical programs with equilibrium constraints, modelling and sample average approximation, Optimization 57 (2008), pp. 395-418.
    • (2008) Optimization , vol.57 , pp. 395-418
    • Shapiro, A.1    Xu, H.2
  • 20
    • 61349157967 scopus 로고    scopus 로고
    • Scatter search and local NLP solvers: A multistart framework for global optimization
    • Z. Ugray et al., Scatter search and local NLP solvers: A multistart framework for global optimization, INFORMS J Computing 19 (2007), pp. 328-340.
    • (2007) INFORMS J Computing , vol.19 , pp. 328-340
    • Ugray, Z.1


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