Advertisement

The MCCNF Problem With a Fixed Number of Nonlinear Arc Costs: Complexity and Approximation

  • Hoang Tuy
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 42)

Abstract

We discuss the polynomial solvability of the minimum concave cost network flow problem (MCCNFP) with fixed numbers of sources and nonlinear arc costs and present some approximation algorithms for this variant of MCCNFP. In the single source uncapacitated case the MCCNFP is shown to be polynomially equivalent to a concave production transportation problem. A new strongly polynomial-time algorithm is presented for the latter problem, together with a new efficient approximation approach based on monotonic optimization.

Keywords

Minimum concave cost flow concave production-transportation problem strongly polynomial algorithms approximation algorithms Lagrange relaxation polyblock outer approximation. 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    D.-Z. Du and P.M. Pardalos (eds): Network Optimization Problems, World Scientific, 1993.Google Scholar
  2. [2]
    R.E. Erickson, C.L. Monna adn A.F. Veinott: Send-and-split method for minimum concave cost network flow, Mathematics of Operations Research 12 (1987), 634–664.MathSciNetzbMATHCrossRefGoogle Scholar
  3. [3]
    M. Florian and P. Robillard: An implicit enumeration algorithm for the concave cost network flow problem, Management Science 18 (1971), 184–193.zbMATHCrossRefGoogle Scholar
  4. [4]
    G. Gallo, C. Sandi and C. Sodini: An algorithm for the min concave cost flow problem, European Journal of Operations Research 4 (1980), 248–259.MathSciNetzbMATHCrossRefGoogle Scholar
  5. [5]
    G. Guisewite and P.M. Pardalos. Minimum concave cost network flow problems: Applications, complexity and algorithms, Annals of Operations Research 25 (1990), 75–100.MathSciNetzbMATHCrossRefGoogle Scholar
  6. [6]
    G. Guisewite and P.M. Pardalos: Algorithms for the single source uncapacitated minimum concave cost network flow problem, Journal of Global Optimization, 1 (1991), 245–265.MathSciNetzbMATHCrossRefGoogle Scholar
  7. [7]
    G. Guisewite and P.M. Pardalos: A polynomial time solvable concave cost network flow problem, Network 23 (1992), 143–147.MathSciNetCrossRefGoogle Scholar
  8. [8]
    G. Guisewite and P.M. Pardalos: Convexity issues in nonconvex network flow problems, in Complexity in Numerical Optimization, ed. P.M. Pardalos, World Scientific 1993, 163–179.CrossRefGoogle Scholar
  9. [9]
    G. Guisewite: Network problems, in Handbook of Global Optimization, eds. R. Horst and P.M. Pardalos, Kluwer 1995, 609–648.Google Scholar
  10. [10]
    K. Holmberg and H. Thy: A production-transportation problem with stochastic demands and concave production costs, Mathematical Programming,to appear.Google Scholar
  11. [11]
    R. Horst and H. Thy: Global Optimization: Deterministic Approaches, Springer, 3rd edition, 1996.Google Scholar
  12. [12]
    H. Konno, P.T. Thach and H. Thy: Optimization on Low Rank Nonconvex Structures, Kluwer, 1997.Google Scholar
  13. [13]
    B. Klinz and H. Thy: Minimum concave cost network flow problems with a single nonlinear arc cost, in Network Optimization Problems, eds. P.M. Pardalos and D.,-Z Du, World Scientific 1993, 125–143.Google Scholar
  14. [14]
    H. Konno, P.T. Thach and H. Thy: Optimization on Low Rank Nonconvex Structures. Kluwer, 1997.Google Scholar
  15. [15]
    M. Minoux: Network synthesis and optimum network design problems, Networks 19 (1989), 313–160.MathSciNetzbMATHCrossRefGoogle Scholar
  16. [16]
    G.L. Nemhauser and L.A. Wolsey: Integer and Combinatorial Optimization, Wiley and Sons 1988.Google Scholar
  17. [17]
    P.M. Pardalos and S.A. Vavasis: Open questions in complexity theory for nonlinear optimization, Mathematical Programming 57 (1992), 337–339.MathSciNetzbMATHCrossRefGoogle Scholar
  18. [18]
    A. Rubinov, H. Thy and H. Mays: Algorithm for a Monotonic Global Optimization Problem. Preprint, SIMS, University of Ballarat, Australia, 1998.Google Scholar
  19. [19]
    R.M. Soland, Optimal facility location with concave costs, Operations Ressearch 22 (1974), 373–382.MathSciNetzbMATHCrossRefGoogle Scholar
  20. [20]
    E. Tardos: A strongly polynomial minimum cost circulation algorithm, Combinatorika 5 (1985), 247–255.MathSciNetzbMATHCrossRefGoogle Scholar
  21. [21]
    P.T. Thach: A decomposition method for the min concave cost flow problem with a special structure, Japn Journal of Applied Mathematics 7 (1990), 103–120.zbMATHCrossRefGoogle Scholar
  22. [22]
    H. Thy: Convex Analysis and Global Optimization, Kluwer Academic Publishers, Boston, Dordrecht, London, 1998Google Scholar
  23. [23]
    H. Thy: Strong polynomial-time solvability of a minimum concave cost network flow problem, Preprint, Institute of Mathematics, Hanoi, 1999; to appear in Acta Mathematica Vietnamica.Google Scholar
  24. [24]
    H. Thy: Monotonic optimization: problems and solution approaches, Preprint, Institute of Mathematics, Hanoi, 1999.Google Scholar
  25. [25]
    H. Thy, N.D. Dan and S. Ghannadan: Strongly Polynomial Time Algorithm for Certain Concave Minimization Problems on Networks, Operations Research Letters, 14 (1993), 99–109.MathSciNetCrossRefGoogle Scholar
  26. [26]
    H. Thy, S. Ghannadan, A. Migdalas and P. Vârbrand): Strongly Polynomial Algorithm for a Production-Transportation Problem with Concave Production Cost, Optimization, 27 (1992), 205–227.Google Scholar
  27. [27]
    H. Thy, S. Ghannadan, A. Migdalas and P. Vârbrand: Heuristics Based on Tabu Search and Lagrangian Relaxation for the Concave Production-Transportation Problem, Studies in Regional and Urban Planning 3 (1994), 127–141.Google Scholar
  28. [28]
    H. Thy, S. Ghannadan, A. Migdalas and P. Vârbrand: The Minimum Concave Cost Flow Problem with Fixed Numbers of Nonlinear Arc Costs and Sources, Journal of Global Optimization 6 (1995), 135–151.CrossRefGoogle Scholar
  29. [29]
    H. Thy, S. Ghannadan, A. Migdalas and P. Vârbrand: A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables. Mathematical Programming 72 (1996), 229–258.MathSciNetGoogle Scholar
  30. [30]
    H. Thy and L.T. Luc: A new approach to optimixation under monotonic constraint. Preprint, Institute of Mathematics, Hanoi, 1999.Google Scholar
  31. [31]
    H. Thy and A. Migdalas: Lagrange relaxation, decoupling and decomposition for the minimum concave cost network flow problem. Preprint, Institute of Mathematics, Hanoi, 1998.Google Scholar
  32. [32]
    A.F. Veinott: Minimum concave cost solution of Leontiev substitution models of multifacility inventory systems, Operations Research 17 (1969), 262–291.MathSciNetzbMATHCrossRefGoogle Scholar
  33. [33]
    H.M. Wagner and T.M. Whitin: Dynamic version of the economic lot size model, Management Science 5 (1959), 89–96.MathSciNetCrossRefGoogle Scholar
  34. [34]
    S.W. Wallace: Decomposition for the requirement space of a transportation problem into polyhedral cones, Mathematical Programming 28 (1986), 29–47.zbMATHGoogle Scholar
  35. [35]
    W.I. Zangwill. Minimum concave cost flows in certain networks, Management Science 14 (1968), 429–450.MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2000

Authors and Affiliations

  • Hoang Tuy
    • 1
  1. 1.Institute of MathematicsBo Ho, HanoiVietnam

Personalised recommendations