Supermodularity in Mean-Partition Problems*
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.
Unable to display preview. Download preview PDF.
- 1.Anily, S., Federgruen, A. 1991Structured partition problemsOperational Research39130149Google Scholar
- 5.Hwang, F.K., Rothblum, U.G. 1996Directional-quasi-convexity, asymmetric Schur-convexity and optionality of consecutive partitionsMathematics Operational Research21540554Google Scholar
- 6.Shapely, L.S. 1971Cores of convex gormesInternational Journal of Game Theory11129Google Scholar