Global Separable Programming,
Abstract
The paper describes two branch and bound algorithms for finding the global optimum to separable programming problems. Both algorithms use partitioning of the interval into sub-intervals, which do not include the 'interval of LP optimality' (a sub-interval associated with a local optimum). One algorithm makes use of solutions to the associated LP without restricted basis entry. The other algorithm maintains the restricted basis entry and consequently requires a smaller tableau. Both algorithms are suited to solving the get feasible problem, and can be used in a global search for solutions to simultaneous separable nonlinear equations. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jan 25, 1972
- Accession Number
- AD0736807
Entities
People
- Philip B. Zwart
Organizations
- University of Washington