Abstract
A non-convex optimization problem involving minimization of the sum of max and min concave functions over a transportation polytope is studied in this paper. Based upon solving at most (g+1)(< p) cost minimizing transportation problems with m sources and n destinations, a polynomial time algorithm is proposed which minimizes the concave objective function where, p is the number of pairwise disjoint entries in the m× n time matrix {t ij } sorted decreasingly and T g is the minimum value of the max concave function. An exact global minimizer is obtained in a finite number of iterations. A numerical illustration and computational experience on the proposed algorithm is also included.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ahuja, R.K., J.B. Orlin, C. Stein and R.E. Tarjan. (1994). “Improved Algorithms for Bipartite Network Flow.” SIAM Journal of Computing 23, 906–933.
Bansal, S. and M.C. Puri. (1980). “A Min-Max Problem.” ZOR 24, 191–200.
Burkard, R. E. and F. Rendl. (1991). “Lexicographic Bottleneck Problems.” Oper. Res. Letters 10, 303–308.
Hoang, Tuy. (1999). “Strongly Polynomial Time Solvability of a Minimum Concave Cost Network Flow Problem.” Acta Mathematica Vietnamica 24, 63–71.
Hoang, Tuy, Saied Ghannadan, Migdalays Athanasios, and Várbrand Petel. (1996). “A Strongly Polynomial Algorithm for a Concave Production-Transportation Problem with a Fixed Number of Nonlinear Variables.” Mathematical Programming 72, 229–258.
Kuno, T. and T. Utsunomiya. (2000). “A Lagrangian Based Branch-and-Bound Algorithm for Production Transportation Problem.” Journal of Global Optimization 18(1), 59–73. Locatelli, M and N.V. Thoai. (2001). “Finite Exact Branch-and-Bound Algorithm for Concave Minimization Over Polytopers.” Journal of Global Optimization 18(2), 107–128. Mangasarian, O.L. (1969). Nonlinear Programming. Tata McGraw-Hill Publishing Company Limited.
Mathur, K. and M. C. Puri. (1994). “Combinatorial Problems Involving Sum of a Finite Number of Bottlenecks as Objective.” Asia-Pacific Journal of Operational Research 11, 31–39.
Mazzola, J. B. and A. W. Neebe. (1993). “An Algorithm for the Bottleneck Generalized Assignment Problem.” Computers and Operations Research 20(4), 355–362.
Orlin, J. B. (1988). “A Faster Strongly Polynomial Minimum Cost Flow Algorithm.” In Proceedings of the twentieth annual ACM symposium on theory of computing pages 377–387, New York: ACM Press.
Sherali, H. D. (1982). “Equivalent Weights for Lexicographic Multi-Objective Programs Characterization and Computations.” European Journal of Operational research 11, 367–379.
Tardos, E. (1986). “A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programming.” Operations Research 34, 250–256.
Author information
Authors and Affiliations
Corresponding author
Additional information
We are thankful to Prof. S. N. Kabadi, University of New Brunswick-Fredericton, Canada, who initiated us to the type of problem discussed in this paper. We are also thankful to Mr. Ankit Khandelwal, Ms. Neha Gupta and Ms. Anuradha Beniwal, who greatly helped us in the implementation of the proposed algorithm.
An erratum to this article is available at http://dx.doi.org/10.1007/s10479-006-0056-1.
Rights and permissions
About this article
Cite this article
Puri, S., Puri, M.C. Max-min sum minimization transportation problem. Ann Oper Res 143, 265–275 (2006). https://doi.org/10.1007/s10479-006-7387-9
Issue Date:
DOI: https://doi.org/10.1007/s10479-006-7387-9