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

Full description

Saved in:
Bibliographic Details
Published in:Journal of global optimization Vol. 11; no. 2; pp. 163 - 180
Main Authors: Kuno, Takahito, Utsunomiya, Takahiro
Format: Journal Article
Language:English
Published: Dordrecht Springer Nature B.V 01.09.1997
Subjects:
Algorithms
Factories
Network management systems
Optimization
Warehouses
ISSN:0925-5001, 1573-2916
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0925-5001
1573-2916
DOI:10.1023/A:1008278625289