Skip to main content
SpringerLink
Log in

Using shortest paths in some transshipment problems with concave costs

  • Published:
Mathematical Programming Submit manuscript

Abstract

This paper deals with the problem of solving an uncapacitated transshipment problem with either one source and several sinks or one sink and several sources. The cost function of the problem is concave in the amount shipped on each arc and thus local optima are possible. A characterization of adjacent extreme flows in terms of corresponding arborescences is given for this type of networks.

This characterization together with shortest path methods is then used to attack the problems of finding local optima and of ranking extreme points.

A real-world problem and computational evidence for the usefulness of the method are produced.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. G. Alloin, “A simple method for a class of non-convex separable problems”,Management Science 17 (1970) 66–77.

    Google Scholar 

  2. R.S. Barr, F. Glover and D. Klingman, “An improved version of the out-of-kilter method and a comparative study of computer codes”,Mathematical Programming 7 (1974) 60–86.

    Google Scholar 

  3. A.V. Cabot and R.L. Francis, “Solving certain non-convex quadratic minimization problems by ranking the extreme points”,Operations Research 18 (1970) 82–86.

    Google Scholar 

  4. G.B. Dantzig,Linear programming and extensions (Princeton University Press, Princeton, RI, 1963).

    Google Scholar 

  5. E.W. Dijkstra, “A note on two problems in connection with graphs”,Numerische Mathematik 1 (1959) 269–271.

    Google Scholar 

  6. F. Glover, D. Klingman and J. Stutz, “Augmented threaded index method for network optimization”,INFOR Canadian Journal of Operational Research and Information Processing 12 (1974) 293–298.

    Google Scholar 

  7. E.L. Lawler, “A procedure for computing theK best solutions to discrete optimization problems and its application to shorthest path problems”,Management Science 18 (1972) 401–405.

    Google Scholar 

  8. P.G. McKeown and D.S. Robin, “Adjacent vertices on transportation polytopes”,Naval Research Logistics Quarterly 22 (1975) 2.

    Google Scholar 

  9. K.G. Murty, “Solving the fixed-charge problem by ranking extreme points”,Operations Research 16 (1968) 268–279.

    Google Scholar 

  10. L. Rech and G. Barton, “A non-convex transportation algorithm”, in: E. Beale, ed.,Applications of mathematical programming techniques (English Universities Press, London 1970) pp. 250–260.

    Google Scholar 

  11. H.A. Taha, “Concave minimization over a convex polyhedron”,Naval Research Logistics Quarterly, 20 (1973) 533–548.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université Catholique de Louvain, Heverlee, Belgium

    Gery Daeninck & Yves Smeers

Authors
  1. Gery Daeninck
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yves Smeers
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Daeninck, G., Smeers, Y. Using shortest paths in some transshipment problems with concave costs. Mathematical Programming 12, 18–25 (1977). https://doi.org/10.1007/BF01593766

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01593766

Keywords

Search

Navigation