Finding Equivalent Network Formulations for Constrained Network Problems

Darwin Klingman
Additional contact information
Darwin Klingman: University of Texas at Austin

Management Science, 1977, vol. 23, issue 7, 737-744

Abstract: This paper describes a procedure for determining if constrained network problems (i.e., network problems with additional linear constraints) can be transformed into equivalent pure network problems by a linear transformation involving the node constraints and the extra constraints. These results extend procedures for problems in which the extra constraints consist of bounding certain partial sums of variables. This has proved to be an effective managerial technique for a major automobile manufacturer and a major energy modeling company.

Date: 1977
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.23.7.737 (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:23:y:1977:i:7:p:737-744

Access Statistics for this article

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