Negative Cycles, Duality and the Simplex Method.

Abstract

The minimal cost flow problem can be solved by several types of algorithms. Two such methods are the simplex method of linear programming and the negative cycle method. This paper provides a duality result for the negative cycle method and illustrates several differences between the two methods. (Author)

Document Details

Document Type
Technical Report
Publication Date
Mar 15, 1973
Accession Number
AD0758016

Entities

People

  • Gerald E. Bennington
  • Richard J. Coppins

Organizations

  • North Carolina State University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Evolutionary Algorithms
  • Heuristic Methods
  • Linear Programming
  • Mathematics
  • Simplex Method

Fields of Study

  • Mathematics

Readers

  • Approximation Theory.
  • Computational Modeling and Simulation