A Pseudo-Polynomial Primal-Dual Algorithm for Globally Solving a Production-Transportation Problem

In this paper, we propose a primal-dual algorithm for solving a class ofproduction-transportation problems. Among m(≥ 2) sources two factoriesexist, which produce given goods at some concave cost and supply them to nterminals. We show that one can globally minimize the total cost ofproduction and tr...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of global optimization Jg. 11; H. 2; S. 163 - 180
Hauptverfasser: Kuno, Takahito, Utsunomiya, Takahiro
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Dordrecht Springer Nature B.V 01.09.1997
Schlagworte:
Algorithms
Factories
Network management systems
Optimization
Warehouses
ISSN:0925-5001, 1573-2916
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we propose a primal-dual algorithm for solving a class ofproduction-transportation problems. Among m(≥ 2) sources two factoriesexist, which produce given goods at some concave cost and supply them to nterminals. We show that one can globally minimize the total cost ofproduction and transportation by solving a Hitchcock transportation problemwith m sources and n terminals and a minimum linear-cost flow problem withm+n nodes. The number of arithmetic operations required by the algorithm ispseudo-polynomial in the problem input length.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0925-5001
1573-2916
DOI:10.1023/A:1008278625289