메뉴 건너뛰기




Volumn 18, Issue 3, 2001, Pages 295-309

Integrating SQP and branch-and-bound for mixed integer nonlinear programming

Author keywords

Branch and bound; Mixed integer nonlinear programming; Sequential quadratic programming

Indexed keywords

COMPUTER SOFTWARE; INTEGER PROGRAMMING; ITERATIVE METHODS; QUADRATIC PROGRAMMING; TREES (MATHEMATICS);

EID: 0035269242     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1011241421041     Document Type: Article
Times cited : (204)

References (31)
  • 1
    • 0028413557 scopus 로고
    • An improved branch and bound algorithm for mixed integer nonlinear programming
    • B. Borchers and J.E. Mitchell, "An improved branch and bound algorithm for mixed integer nonlinear programming," Computers and Operations Research, vol. 21, no. 4, pp. 359-367, 1994.
    • (1994) Computers and Operations Research , vol.21 , Issue.4 , pp. 359-367
    • Borchers, B.1    Mitchell, J.E.2
  • 2
    • 0031207490 scopus 로고    scopus 로고
    • A computational comparison of branch and bound and outer approximation methods for 0-1 mixed integer nonlinear programs
    • B. Borchers and J.E. Mitchell, "A computational comparison of branch and bound and outer approximation methods for 0-1 mixed integer nonlinear programs," Computers and Operations Research, vol. 24, no. 8, pp. 699-701, 1997.
    • (1997) Computers and Operations Research , vol.24 , Issue.8 , pp. 699-701
    • Borchers, B.1    Mitchell, J.E.2
  • 4
    • 0343537815 scopus 로고    scopus 로고
    • Methods for nonlinear constraints in optimization calculations
    • Report RAL-TR-96-042, Rutherford Appleton Laboratory, 1996. To appear I. Duff and G.A. Watson (Eds.)
    • A.R. Conn, N.I.M. Gould, and Ph.L. Toint, "Methods for nonlinear constraints in optimization calculations," Report RAL-TR-96-042, Rutherford Appleton Laboratory, 1996. (To appear in The State of the Art in Numerical Analysis, I. Duff and G.A. Watson (Eds.)).
    • The State of the Art in Numerical Analysis
    • Conn, A.R.1    Gould, N.I.M.2    Toint, Ph.L.3
  • 5
    • 0000000310 scopus 로고
    • A tree search algorithm for mixed integer programming problems
    • R.J. Dakin, "A tree search algorithm for mixed integer programming problems," Computer Journal, vol. 8, pp. 250-255, 1965.
    • (1965) Computer Journal , vol.8 , pp. 250-255
    • Dakin, R.J.1
  • 6
    • 0033413991 scopus 로고    scopus 로고
    • A trust-region approach to nonlinear systems of equalities and inequalities
    • J.E. Dennis, M. El-Alem, and K.A. Williamson, "A trust-region approach to nonlinear systems of equalities and inequalities," SIAM Journal on Optimization, vol. 9, pp. 291-315, 1999.
    • (1999) SIAM Journal on Optimization , vol.9 , pp. 291-315
    • Dennis, J.E.1    El-Alem, M.2    Williamson, K.A.3
  • 7
    • 0022902024 scopus 로고
    • An outer-approximation algorithm for a class of mixed-integer nonlinear programs
    • M. Duran and I.E. Grossmann, "An outer-approximation algorithm for a class of mixed-integer nonlinear programs," Mathematical Programming, vol. 36, pp. 307-339, 1986.
    • (1986) Mathematical Programming , vol.36 , pp. 307-339
    • Duran, M.1    Grossmann, I.E.2
  • 8
    • 0012052633 scopus 로고
    • An inexact trust-region feasible-point algorithm for non-linear systems of equalities and inequalities
    • Department of Computational and Applied Mathematics, Rice University, Houston, Texas, USA
    • M. El-Hallabi and R.A. Tapia, "An inexact trust-region feasible-point algorithm for non-linear systems of equalities and inequalities," Technical Report TR-09, Department of Computational and Applied Mathematics, Rice University, Houston, Texas, USA, 1995.
    • (1995) Technical Report TR-09
    • El-Hallabi, M.1    Tapia, R.A.2
  • 10
    • 33947605053 scopus 로고
    • Solving mixed integer nonlinear programs by outer approximation
    • R. Fletcher and S. Leyffer, "Solving mixed integer nonlinear programs by outer approximation," Mathematical Programming, vol. 66, pp. 327-349, 1994.
    • (1994) Mathematical Programming , vol.66 , pp. 327-349
    • Fletcher, R.1    Leyffer, S.2
  • 11
    • 0003501597 scopus 로고    scopus 로고
    • Nonlinear programming without a penalty function
    • Department of Mathematics, University of Dundee, Sept.
    • R. Fletcher and S. Leyffer, "Nonlinear programming without a penalty function," Numerical Analysis Report NA/171, Department of Mathematics, University of Dundee, Sept. 1997.
    • (1997) Numerical Analysis Report NA/171
    • Fletcher, R.1    Leyffer, S.2
  • 13
    • 34250076248 scopus 로고
    • Decomposition in general mathematical programming
    • O.E. Flippo and A.H.G. Rinnoy Kan, "Decomposition in general mathematical programming," Mathematical Programming, vol. 60, pp. 361-382, 1993.
    • (1993) Mathematical Programming , vol.60 , pp. 361-382
    • Flippo, O.E.1    Rinnoy Kan, A.H.G.2
  • 16
    • 0003077343 scopus 로고    scopus 로고
    • Mixed-integer nonlinear programming: A survey of algorithms and applications
    • A.R. Conn, L.T. Biegler, T.F. Coleman, and F.N. Santosa (Eds.), Springer: New York, Berlin
    • I.E. Grossmann and Z. Kravanja, "Mixed-integer nonlinear programming: A survey of algorithms and applications," in Large-Scale Optimization with Applications, Part II: Optimal Design and Control, A.R. Conn, L.T. Biegler, T.F. Coleman, and F.N. Santosa (Eds.), Springer: New York, Berlin, 1997.
    • (1997) Large-Scale Optimization with Applications, Part II: Optimal Design and Control
    • Grossmann, I.E.1    Kravanja, Z.2
  • 18
    • 0022208326 scopus 로고
    • Branch and bound experiments in convex nonlinear integer programming
    • O.K. Gupta and A. Ravindran, "Branch and bound experiments in convex nonlinear integer programming," Management Science, vol. 31, pp. 1533-1546, 1985.
    • (1985) Management Science , vol.31 , pp. 1533-1546
    • Gupta, O.K.1    Ravindran, A.2
  • 19
    • 34250293137 scopus 로고
    • A globally convergent method for nonlinear programming
    • S.P. Han, "A globally convergent method for nonlinear programming," Journal of Optimization Theory and Applications, vol. 22, no. 3, pp. 297-309, 1977.
    • (1977) Journal of Optimization Theory and Applications , vol.22 , Issue.3 , pp. 297-309
    • Han, S.P.1
  • 21
    • 0024063926 scopus 로고
    • Global optimization of nonconvex mixed-integer nonlinear programming (MINLP) problems in process synthesis
    • G.R. Kocis and I.E. Grossmann, "Global optimization of nonconvex mixed-integer nonlinear programming (MINLP) problems in process synthesis," Industrial Engineering Chemistry Research, vol. 27, pp. 1407-1421, 1988.
    • (1988) Industrial Engineering Chemistry Research , vol.27 , pp. 1407-1421
    • Kocis, G.R.1    Grossmann, I.E.2
  • 22
    • 0001173632 scopus 로고
    • An automatic method for solving discrete programming problems
    • A.H. Land and A.G. Doig, "An automatic method for solving discrete programming problems," Econometrica, vol. 28, pp. 497-520, 1960.
    • (1960) Econometrica , vol.28 , pp. 497-520
    • Land, A.H.1    Doig, A.G.2
  • 23
    • 0002207938 scopus 로고
    • A fast algorithm for nonlinearly constrained optimization calculations
    • G.A. Watson (Ed.), Springer Verlag: Berlin
    • M.J.D. Powell, "A fast algorithm for nonlinearly constrained optimization calculations," in Numerical Analysis, 1977, G.A. Watson (Ed.), Springer Verlag: Berlin 1978, pp. 144-157.
    • (1977) Numerical Analysis , pp. 144-157
    • Powell, M.J.D.1
  • 24
    • 0026932968 scopus 로고
    • An LP/NLP based branch-and-bound algorithm for convex MINLP optimization problems
    • I. Quesada and I.E. Grossmann, "An LP/NLP based branch-and-bound algorithm for convex MINLP optimization problems," Computers and Chemical Engineering, vol. 16, pp. 937-947, 1992.
    • (1992) Computers and Chemical Engineering , vol.16 , pp. 937-947
    • Quesada, I.1    Grossmann, I.E.2
  • 26
    • 0343537796 scopus 로고    scopus 로고
    • A branch-and-cut method for 0-1 mixed convex programming
    • Department of IE/MS, Northwestern University, Evanston, IL 60208, USA, Jan.
    • R.A. Stubbs and S. Mehrotra, "A branch-and-cut method for 0-1 mixed convex programming," Technical report 96-01, Department of IE/MS, Northwestern University, Evanston, IL 60208, USA, Jan. 1996.
    • (1996) Technical Report 96-01
    • Stubbs, R.A.1    Mehrotra, S.2
  • 27
    • 0027697225 scopus 로고
    • Optimal feed location and number of trays for distillation columns with multiple feeds
    • J. Viswanathan and I.E. Grossmann, "Optimal feed location and number of trays for distillation columns with multiple feeds," I&EC Research, vol. 32, pp. 2942-2949, 1993.
    • (1993) I&EC Research , vol.32 , pp. 2942-2949
    • Viswanathan, J.1    Grossmann, I.E.2
  • 28
    • 0000292937 scopus 로고
    • Models and methods of solution of quadratic integer programming problems
    • O.V Volkovich, V.A. Roshchin, and I.V. Sergienko, "Models and methods of solution of quadratic integer programming problems," Cybernetics, vol. 23, pp. 289-305, 1987.
    • (1987) Cybernetics , vol.23 , pp. 289-305
    • Volkovich, O.V.1    Roshchin, V.A.2    Sergienko, I.V.3
  • 30
    • 0004102294 scopus 로고
    • Ph.D. Thesis, Harvard University Graduate School of Business Administration
    • R.B. Wilson, "A simplicial algorithm for concave programming, Ph.D. Thesis, Harvard University Graduate School of Business Administration, 1963.
    • (1963) A Simplicial Algorithm for Concave Programming
    • Wilson, R.B.1
  • 31
    • 0041760211 scopus 로고
    • Trust region algorithms for nonlinear equations
    • Department of Mathematics, Hong Kong University, Hong Kong
    • Y Yuan, "Trust region algorithms for nonlinear equations," Technical Report 049, Department of Mathematics, Hong Kong University, Hong Kong, 1994.
    • (1994) Technical Report 049
    • Yuan, Y.1


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