Accession Number:

ADA048296

Title:

Network Versus Linear Programming Algorithms and Implementations

Descriptive Note:

Research rept.

Corporate Author:

TEXAS UNIV AT AUSTIN CENTER FOR CYBERNETIC STUDIES

Report Date:

1977-09-01

Pagination or Media Count:

31.0

Abstract:

Over the years modelers and practitioners have become so adept at designing large scale linear programming problems that in some cases the complexity is staggering. This has led to a demand for alternative design and solution procedures. Noting that the vast majority of linear programming problems contain at least some embedded network structure, researchers in the network area have made many advances in the past few years. This paper provides insights as to why network techniques are having such a large impact on modelers and why network solution procedures are being selected over standard linear programming systems for use in many real world applications. As dramatic proof of the savings offered by network solution procedures, various network computer codes are compared with the standard linear programming system APEX-III. Results indicate that the network techniques are 200 times faster on highly structured problems and as much as 25 times faster on more complex embedded network problems.

Subject Categories:

  • Operations Research
  • Computer Hardware
  • Computer Systems

Distribution Statement:

APPROVED FOR PUBLIC RELEASE