H. Tuy et al., A STRONGLY POLYNOMIAL ALGORITHM FOR A CONCAVE PRODUCTION-TRANSPORTATION PROBLEM WITH A FIXED NUMBER OF NONLINEAR VARIABLES, Mathematical programming, 72(3), 1996, pp. 229-258
Citations number
34
Categorie Soggetti
Operatione Research & Management Science",Mathematics,"Operatione Research & Management Science",Mathematics,"Computer Science Software Graphycs Programming
We show that the production-transportation problem involving an arbitr
ary fixed number of factories with concave production cost is solvable
in strongly polynomial time. The algorithm is based on a parametric a
pproach which takes full advantage of the specific structure of the pr
oblem: monotonicity of the objective function along certain directions
, small proportion of nonlinear variables and combinatorial properties
implied by transportation constraints.