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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of global optimization Ročník 11; číslo 2; s. 163 - 180
Hlavní autoři: Kuno, Takahito, Utsunomiya, Takahiro
Médium: Journal Article
Jazyk:angličtina
Vydáno: Dordrecht Springer Nature B.V 01.09.1997
Témata:
Algorithms
Factories
Network management systems
Optimization
Warehouses
ISSN:0925-5001, 1573-2916
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0925-5001
1573-2916
DOI:10.1023/A:1008278625289