๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Infinite networks: Minimal cost flows

โœ Scribed by B. Fuchssteiner; K. Morisse

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
323 KB
Volume
9
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

โœฆ Synopsis

We are concerned with the minimal cost flow problem in infinite networks. The generalisation to infinite networks is made in order to provide tools for the study of the dynamics of such networks. By disintegration methods, we obtain that the minimal transportation costs are the supremum of the differences between consumption cost and transportation profit taken over all local price systems. Thus, by our method, results for which finite networks are usually obtained by the strong duality theorem, can be generalized to infinite networks.

๐Ÿ“œ SIMILAR VOLUMES

Flows in infinite networks represented b
Flows in infinite networks represented by vector lattices
โœ B. Fuchssteiner; K. Morisse ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 294 KB

We are concerned with minimal cost flows in infinite networks. As an application of a Hahn-Banach type monotone extension theorem for convex cones, an abstract theorem characterizing minimal cost flows by local price systems is obtained for a general vector lattice situation. This result extends the

A network flow model for clustering segm
A network flow model for clustering segments and minimizing total maintenance and rehabilitation cost
โœ I-Lin Wang; Yi-Chang James Tsai; Feng Li ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 419 KB

Because of shrinking budgets, transportation agencies are facing severe challenges in the preservation of deteriorating pavements. There is an urgent need to develop a methodology that minimizes maintenance and rehabilitation (M&R) cost. To minimize total network M&R cost of clustering pavement segm