Multimodularity, Convexity and Optimization Properties - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Mathematics of Operations Research Year : 2000

Multimodularity, Convexity and Optimization Properties


We investigate in this paper the properties of multimodular functions. In doing so we give elementary proofs for properties already established by Hajek, and we generalize some of his results. In particular, we extend the relation bewteen convexity and multimodularity to some convex subsets of the integers numbers. We also obtain general optimizatnio results for average costs related to a sequence of multimodular functions rather than to a single functions. Under this general context, we show that the expected average cost problem is optimized by ising balanced sequences. We finally illustrate the usefulness of this theory in admission control into a D/D/1 queue with fixed bathch arrivals, with no state information. We show that the balanced policy minimizes the average queue length for the case of an intinite queeu, but not for the case of a finite queue. When further adding a constraint on the losses, it si show that a balanced policy is also optimal for the finite queue case.
Fichier principal
Vignette du fichier
mor-mm.pdf (311.86 Ko) Télécharger le fichier

Dates and versions

inria-00113337 , version 1 (13-11-2006)



Eitan Altman, Bruno Gaujal, Arie Hordijk. Multimodularity, Convexity and Optimization Properties. Mathematics of Operations Research, 2000, 25 (2), pp.324-347. ⟨10.1287/moor.25.2.324.12230⟩. ⟨inria-00113337⟩
147 View
426 Download



Gmail Facebook X LinkedIn More