Skip to main content
SpringerLink
Log in

A decomposition method using a pricing mechanism for min concave cost flow problems with a hierarchical structure

  • Published:
Mathematical Programming Submit manuscript

Abstract

In this paper we develop a decomposition method using a pricing mechanism which has been widely applied to linear and convex programs for a class of nonconvex optimization problems that are min concave cost flow problems under directed, uncapacitated networks with a hierarchical structure.

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. K.L. Hoffman, “A method for globally minimizing concave functions over convex sets,”Mathematical Programming 20 (1981) 22–32.

    Google Scholar 

  2. R. Horst, N.V. Thoai and J.D. Vries, “On finding new vertices and redundant constraints in cutting plane algorithm for global optimization,”Operations Research Letters 7 (1988) 85–90.

    Google Scholar 

  3. G. Gallo and C. Sodini, “Adjacent extreme flows and applications to min concave cost flow problems,”Networks 9 (1979) 95–121.

    Google Scholar 

  4. G. Gallo, C. Sandi and C. Sodini, “An algorithm for the min concave cost flow problems,”European Journal Operational Research 4 (1980) 248–255.

    Google Scholar 

  5. G. Gallo, “Lower planes for the network design problem,”Networks 13 (1983) 411–426.

    Google Scholar 

  6. D.S. Johnson, J.K. Lenstra and A.H. Rinnooy Kan, “The complexity of the network design problem,”Networks 8 (1978) 279–285.

    Google Scholar 

  7. L.S. Lasdon,Optimization Theory for Large System (Macmillan, New York, 1970).

    Google Scholar 

  8. T.L. Magnanti, P. Mireault and R.T. Wong, “Tailoring Benders' decomposition for uncapacitated network design,”Mathematical Programming Study 26 (1986) 112–154.

    Google Scholar 

  9. R.T. Rockafellar,Convex Analysis (Princeton University Press, Princeton, NJ, 1970).

    Google Scholar 

  10. R.M. Soland, “Optimal facility location with concave cost,”Operations Research 22 (1974) 373–382.

    Google Scholar 

  11. P.T. Thach, “A decomposition method for the min concave cost flow problem with a staircase structure,” to appear in:Japan Journal of Applied Mathematics.

  12. H. Tuy, “On polyhedral annexation method for concave minimization,” to appear in:Volume dedicated to the Memory of L. V. Kantorovich (American Mathematical Society, Providence, RI).

  13. D.A. Wismer,Optimization Methods for Large-scale Systems⋯ With Applications (McGraw-Hill, New York, NY, 1971).

    Google Scholar 

  14. W.I. Zangwill, “minimum concave cost flows in certain networks,”Management Science 14 (1968) 429–450.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, PO Box 631, Boho, Hanoi, Vietnam

    Phan Thien Thach

Authors
  1. Phan Thien Thach
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This paper was completed during the author's stay supported by a Sophia lecturing-research Grant at Sophia University, Tokyo, Japan.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Thach, P.T. A decomposition method using a pricing mechanism for min concave cost flow problems with a hierarchical structure. Mathematical Programming 53, 339–359 (1992). https://doi.org/10.1007/BF01585711

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation