An approach to discrete convexity and its use in an optimal fleet mix problem
No Thumbnail Available
Date
2006
Journal Title
Journal ISSN
Volume Title
Publisher
Springer-Verlag Berlin
Open Access Color
OpenAIRE Downloads
OpenAIRE Views
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.
Description
Keywords
Discrete Programming, Discrete Convexity, Optimal Fleet Mix
Turkish CoHE Thesis Center URL
Fields of Science
Citation
Cambini, Riccardo; Riccardi, Rossana; Yüceer, Ümit, "An approach to discrete convexity and its use in an optimal fleet mix problem", Generalized Convexity And Related Topics, Vol.583, pp.133-148, (2006).
WoS Q
Scopus Q
Source
Generalized Convexity And Related Topics
Volume
583
Issue
Start Page
133
End Page
148
