Abstract
Supermodularity of the λ function which defines a permutation polytope has proved to be crucial for the polytope to have some nice fundamental properties. Supermodularity has been established for the λ function for the sum-partition problem under various models. On the other hand, supermodularity has not been established for the mean-partition problem even for the most basic labeled single-shape model. In this paper, we fill this gap and also settle for all other models except one. We further extend our results to other types of supermodularity.
Similar content being viewed by others
References
S. Anily A. Federgruen (1991) ArticleTitleStructured partition problems Operational Research 39 130–149
B. Gao F.K. Hwang W.W-C. Li U.G. Rothblum (1999) ArticleTitlePartition polytopes over 1-dimensional points Mathematical Programming 85 335–362 Occurrence Handle10.1007/s101070050060
F.K. Hwang J.S. Lee U.G. Rothblum (2004) ArticleTitlePermutation polytopes corresponding to strongly supermodular functions Discrete Applied Mathematics 142 52–97 Occurrence Handle10.1016/j.dam.2002.11.010
F.K. Hwang M.M. Liao C.Y. Chen (2000) ArticleTitleSupermodularity of various partition problems Journal of Global Optimization 18 275–282 Occurrence Handle10.1023/A:1008397707916
F.K. Hwang U.G. Rothblum (1996) ArticleTitleDirectional-quasi-convexity, asymmetric Schur-convexity and optionality of consecutive partitions Mathematics Operational Research 21 540–554
L.S. Shapely (1971) ArticleTitleCores of convex gormes International Journal of Game Theory 1 11–29
Author information
Authors and Affiliations
Corresponding author
Additional information
*This research is partially supported by a Republic of China National Science grant NSC 92-2115-M-009-014.
Rights and permissions
About this article
Cite this article
Chang, F.H., Hwang, F.K. Supermodularity in Mean-Partition Problems*. J Glob Optim 33, 337–347 (2005). https://doi.org/10.1007/s10898-004-7391-z
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10898-004-7391-z