Library Header Image
LSE Research Online LSE Library Services

The practical conversion of linear programmes to network flow models

Baston, V. J. D., Rahmouni, M. K. and Williams, H. Paul (1991) The practical conversion of linear programmes to network flow models. European Journal of Operational Research, 50 (3). pp. 325-334. ISSN 0377-2217

Full text not available from this repository.
Identification Number: 10.1016/0377-2217(91)90264-V


A practical algorithm for converting Linear (and Integer) Programs to Minimum Cost Network Flow Models is described. Reasons for the importance of such conversions are given. The method depends on the representation of a network by one of its Polygon Matrices. In this representation, which is described, polygons (circuits) of a network are given in terms of a spanning tree.

Item Type: Article
Official URL:
Additional Information: © 1991 Elsevier B.V.
Divisions: Management
Subjects: Q Science > QA Mathematics
Sets: Research centres and groups > Management Science Group
Departments > Management
Date Deposited: 23 Jan 2011 18:02
Last Modified: 19 Feb 2019 23:24

Actions (login required)

View Item View Item