MEASURE THEORETICAL FOUNDATIONS OF SURFACE AREA THEORY.
Final rept. for 15 Jun 62-10 Jul 65,
OHIO STATE UNIV RESEARCH FOUNDATION COLUMBUS
Pagination or Media Count:
A mathematically adequate basis is given for a primal algorithm to solve a special category of integer linear programming problems. The basis is the resolvent sequence which leaves great latitude for implementing the algorithm on a computer. One such specific algorithm utilizes the dual problem in the process of obtaining a resolvent sequence and, hence, an optimal contestant. Furthermore, the specific strategies used in the algorithm aim to obtain intermediate contestants which closely approximate the optimum, and aim to obtain lower bounds close to the optimum which gives a specific significance to how good an approximation is in regard to the best. Author