An Approach To Discrete Convexity and Its Use in an Optimal Fleet Mix Problem

Abstract

A notion of convexity for discrete functions is first introduced, with the aim to guarantee both the increasing monotonicity of marginal increments and the convexity of the sum of convex functions. Global optimality of local minima is then studied both for single variable functions and for multi variables ones. Finally, a concrete optimal fleet mix problem is studied, pointing out its discrete convexity properties. © 2006 Springer-Verlag Berlin Heidelberg.