ON A MATHEMATICAL MODEL FOR THE OPTIMUM PROGRAMMING OF A DRUM COMPUTER,

Abstract

In this report a mathematical model is developed for a certain minimization problem. The problem consists of minimizing the time needed to execute a given sequence of commands on a drum computer. The problem is recast as a linear programming problem where the solutions are restricted to be positive integers. Hence, such an algorithm as the one developed by Gomory, can be used to solve this problem. For some programs, the number of variables and restrictions in the model will probably become too large; however, perhaps, certain portions of each of these programs can be independently optimized without elevating the over-all optimum too greatly. To describe these techniques a fictitious drum computer is employed. This computer has most of the general features that one might expect to find in a drum computer. (Author)

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1959
Accession Number
AD0833218

Entities

People

  • F. M. Chadwick
  • H. L. Loeb

Organizations

  • General Dynamics

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Computers
  • Heuristic Methods
  • Linear Programming
  • Mathematical Models
  • Mathematics
  • Models
  • Sequences

Fields of Study

  • Computer science
  • Mathematics

Readers

  • Computational Modeling and Simulation
  • Logistics and Supply Chain Management.
  • Operations Research