论文信息 - Branch and Bound for Global NLP: Iterative LP Algorithm & Results

Branch and Bound for Global NLP: Iterative LP Algorithm & Results

This chapter presents a branch and bound algorithm for global solution of nonconvex nonlinear programs The algorithm utilizes the covering program developed in the previous chapter to compute bounds over rectangular domain partitions. An adaptive rectangular partitioning strategy is employed to locate and verify a global solution.

Ross E. Swaney | Thomas G. W. Epperly

[1] P. Gill,et al. Maintaining LU factors of a general sparse matrix , 1987 .

[2] Elizabeth Eskow,et al. A New Modified Cholesky Factorization , 1990, SIAM J. Sci. Comput..

[3] J. G. Evans,et al. Post Optimal Analyses, Parametric Programming and Related Topics , 1981 .

[4] Mokhtar S. Bazaraa,et al. Nonlinear Programming: Theory and Algorithms , 1993 .