Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

A decomposition algorithm for solving certain classes of production-transportation problems with concave production cost

  • 52 Accesses

  • 4 Citations

Abstract

This paper addresses a method for solving two classes of production-transportation problems with concave production cost. By exploiting a special network structure both problems are reduced to a kind of resource allocation problem. It is shown that the resultant problem can be solved by using dynamic programming in time polynomial in the number of supply and demand points and the total demand.

This is a preview of subscription content, log in to check access.

References

  1. 1.

    DantzigG.B., Linear Programming and Extensions, Princeton University Press, (Princeton, NJ, 1963).

  2. 2.

    DudzińskiK. and S.Walukiewicz, ‘Exact methods for the knapsack problem and its generalizations’, European Journal of Operational Research 28 (1987), 3–21.

  3. 3.

    GuisewiteG.M. and P.M.Pardalos, ‘Minimum concave-cost network flow problems: applications, complexity and algorithms’, Annals of Operations Research 25 (1990), 75–100.

  4. 4.

    GuisewiteG.M. and P.M.Pardalos, ‘A polynomial time solvable concave network flow problem’, Networks 23 (1993), 143–149.

  5. 5.

    HorstR. and H.Tuy, Global Optimization: Deterministic Approaches, Springer-Verlag (Berlin, 1990).

  6. 6.

    NaussR.M., ‘The 0–1 knapsack problem with multiple choice constraints’, European Journal of Operational Research 2 (1978), 125–131.

  7. 7.

    PapadimitriouC.H. and K.Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Princeton-Hall Inc. (Englewood Cliffs, NJ, 1982).

  8. 8.

    TuyH., ‘The complementarity convex structure in global optimization’, Journal of Global Optimization 2 (1992), 21–40.

  9. 9.

    TuyH., N.D.Dan, and S.Ghannadan, ‘Strongly polynomial time algorithms for certain concave minimization problems on networks’, Operations Research Letters 14 (1993), 99–109.

  10. 10.

    TuyH., S.Ghannadan, A.Migdalas, and P.Värbrand, ‘Strongly polynomial algorithm for a production-transportation problem with concave production cost,’ Optimization 27 (1993), 205–227.

  11. 11.

    TuyH., S.Ghannadan, A.Migdalas, and P.Värbrand, ‘Strongly polynomial algorithm for a production-transportation problem with a fixed number of nonlinear variables’, Preprint, Department of Mathematics, Linköping University (Linköping 1993).

  12. 12.

    TuyH., S.Ghannadan, A.Migdalas, and P.Värbrand, ‘The minimum concave cost network flow problem with a fixed number of sources and nonlinear arc costs’, Preprint, Department of Mathematics, Linköping University (Linköping, 1993).

Download references

Author information

Additional information

The author was partially supported by Grand-in-Aid for Scientific Research of the Ministry of Education, Science and Culture, Grant No. (C)05650061.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Kuno, T., Utsunomiya, T. A decomposition algorithm for solving certain classes of production-transportation problems with concave production cost. J Glob Optim 8, 67–80 (1996). https://doi.org/10.1007/BF00229302

Download citation

Key words

  • Concave minimization
  • global optimization
  • production-transportation problem
  • resource allocation problem
  • dynamic programming