A Primal Simplex Approach to Pure Processing Networks

Chou-Hong J. Chen and Michael Engquist
Additional contact information
Chou-Hong J. Chen: School of Business Administration, Gonzaga University, Spokane, Washington 99258
Michael Engquist: Department of General Business, College of Business Administration, University of Texas, Austin, Texas 78712

Management Science, 1986, vol. 32, issue 12, 1582-1598

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 the specialized code is an order of magnitude faster than the general purpose code.

Keywords: networks; processing networks; linear programming (search for similar items in EconPapers)
Date: 1986
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.32.12.1582 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:32:y:1986:i:12:p:1582-1598

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().