A Primal Simplex Approach to Pure Processing Networks.

Abstract

Pure processing network problems are minimum cost flow problems in which the flow entering or leaving a node may be constrained to do so in given proportions. In this paper, new theoretical results concerning pure processing networks are developed, and based on these results, two new primal simplex variants are presented. One of these variants has been implemented and tested against a general purpose linear programming code. A large class of problems is identified for which specialized code is an order of magnitude faster than the general purpose code. Additional keywords: computations; data processing; Fortran.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1985
Accession Number
ADA153986

Entities

People

  • Chia‐Hung Chen
  • M. Engquist

Organizations

  • University of Texas at Austin

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Business Administration
  • Computations
  • Computer Programming
  • Computer Programs
  • Computers
  • Contracts
  • Core Storage
  • Data Storage Systems
  • Iterations
  • Linear Programming
  • Network Topology
  • Simplex Method
  • Splitting
  • United States Government
  • Universities

Fields of Study

  • Physics

Readers

  • Operations Research