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.
KeywordsLine Search Iteration Number Null Space Feasible Point Merit Function
Unable to display preview. Download preview PDF.
- T. Gal. Postoptimal Analyses, Parametric Programming, and Related Topics. McGraw-Hill Inc., 1979.Google Scholar
- P. E. Gill, W. Murray, M. A. Saunders, and M. H. Wright. Maintaining LU factors of a general sparse matrix. Linear Algebra and Its Applications, 88/89:239270, 1987.Google Scholar
- B. A. Murtagh and M. A. Saunders. MINOS 5.1 user’s guide. Technical Report SOL 83–20R, Systems Optimization Laboratory, Stanford University, Stanford, CA 94305–4022, January 1987.Google Scholar
- R. E. Swaney. Global solution of algebraic nonlinear programs AIChE Annual Meeting ( Chicago, IL 1990 ). Publication pending.Google Scholar