Formulating processing network models: Viability theory

John W. Chinneck

Naval Research Logistics (NRL), 1990, vol. 37, issue 2, 245-261

Abstract: A processing network contains at least one processing node; such a node is constrained by fixed ratios of flow in it's terminals. Though fast solution algorithms are available, processing network models are difficult to formulate in the first place so that meaningful results are obtained. Until now, there have been no automated aids for use during the model‐building phase. This article develops the theory of model viability and presents the first such aid: an algorithm for the identification and localization of a class of errors which can occur during model formulation.

Date: 1990
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://doi.org/10.1002/1520-6750(199004)37:23.0.CO;2-D

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:wly:navres:v:37:y:1990:i:2:p:245-261

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().