A COMPUTER PROGRAM FOR A CLASS OF NETWORK-TYPE OPTIMIZATION PROBLEMS

Abstract

AN IBM-650 COMPUTER PROGRAM IS DESCRIBED FOR SOLVING A CERTAIN TYPE OFNETWORK-LIKE LINEAR PROGRAMMING PROBLEM SLIGHTLY MORE GENERAL THAN THE CLASSICAL TRANSPORTATION PROBLEM: NAMELY THAT WHERE THE NETWORK, NODAL INPUTS AND OUTPUTS, AND (CONSTANT) COSTS PER UNIT FLOW ON THE BRANCHES IS SPECIFIED, AND WHERE THE PROBLEM IS TO DETERMINE A SET OF BRANCH FLOWS WHICH MINIMIZES THE COST OF FLOW THROUGH THE NETWORK. INCLUDED ARE A DESCRIPTION OF THE COMPUTER PROGRAM, WITH CHARTS, AND A SMALL COMPLETE EXAMBLE. THE PROGRAM ACCOMODATES NETWORKS WITH UP TO 100 NODES

Document Details

Document Type
Technical Report
Publication Date
Sep 28, 1960
Accession Number
AD0248987

Entities

People

  • C.e. Lemke
  • T.j. Powers

Organizations

  • Rensselaer Polytechnic Institute

Tags

DTIC Thesaurus Topics

  • Application Software
  • Computer Programming
  • Computer Programs
  • Computers
  • Digital Information
  • Linear Programming
  • Mathematical Programming
  • Optimization
  • Software Development Tools
  • Transportation

Fields of Study

  • Computer science
  • Mathematics

Readers

  • Approximation Theory.
  • Computer Science/Computer Engineering/Data Science/Digital Signal Processing.
  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)