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

Riccardo Cambini (), Rossana Riccardi1 () and Ümit Yüceer ()
Additional contact information
Rossana Riccardi1: University of Pisa Faculty of Economics
Ümit Yüceer: Çankaya University

A chapter in Generalized Convexity and Related Topics, 2007, pp 133-148 from Springer

Abstract: Summary 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.

Keywords: Discrete programming; discrete convexity; optimal fleet mix (search for similar items in EconPapers)
Date: 2007
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:lnechp:978-3-540-37007-9_7

Ordering information: This item can be ordered from
http://www.springer.com/9783540370079

DOI: 10.1007/978-3-540-37007-9_7

Access Statistics for this chapter

More chapters in Lecture Notes in Economics and Mathematical Systems from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().