M^♮-Convexity and Its Applications in Operations

M^♮-convexity, one of the main concepts in discrete convex analysis, possesses many salient structural properties and allows for the design of efficient algorithms. In this paper, we establish several new fundamental properties of M^♮-convexity and its variant SSQM^♮-convexity (semistrictly quasi M^♮-convexity). We show that in a parametric maximization model, the optimal solution is nonincreasing in the parameters when the objective function is SSQM^♮-concave and the constraint is a box and illustrate when SSQM^♮-convexity and M^♮-convexity are preserved. A sufficient and necessary characterization of twice continuously differentiable M^♮-convex functions is provided. We then use them to analyze two important operations models: a classical multiproduct dynamic stochastic inventory model and a portfolio contract model where a buyer reserves capacities in blocks from multiple competing suppliers. We illustrate that looking from the lens of M^♮-convexity allows to simplify the complicated analysis in the literature for each model and extend the results to more general settings.