Accession Number : AD0736807

Title :   Global Separable Programming,

Corporate Author : WASHINGTON UNIV ST LOUIS MO CONTROL SYSTEMS SCIENCE AND ENGINEERING

Personal Author(s) : Zwart,Philip B.

Report Date : 25 JAN 1972

Pagination or Media Count : 23

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)

Descriptors :   (*LINEAR PROGRAMMING, ALGORITHMS), SIMPLEX METHOD, RANDOM VARIABLES, INEQUALITIES, OPTIMIZATION

Subject Categories : Operations Research

Distribution Statement : APPROVED FOR PUBLIC RELEASE