MEASURE THEORETICAL FOUNDATIONS OF SURFACE AREA THEORY.

Abstract

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)

Document Details

Document Type
Technical Report
Publication Date
Aug 02, 1965
Accession Number
AD0620038

Entities

People

  • Tibor Rado

Organizations

  • Ohio State University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Computers
  • Evolutionary Algorithms
  • Heuristic Methods
  • Integer Programming
  • Latitude
  • Linear Programming
  • Mathematics
  • Sequences

Fields of Study

  • Chemistry
  • Mathematics

Readers

  • Calculus or Mathematical Analysis
  • Operations Research
  • Systems Analysis and Design