Subextremal functions and lattice programming
Let M and N be the set of minimizers of a function f over respective subsets K and L of a lattice, with K being lower than L. This paper characterizes the class of functions f for which M is lower (resp., weakly lower, meet lower, join lower, chain lower) than N for all K lower than L. The resulting five classes of functions, called subextremal variants, have alternate characterizations by variants of the downcrossing-differences property, i.e., their first differences change sign at most once from plus to minus along complementary chains.
|Date of creation:||04 Sep 2005|
|Date of revision:|
|Note:||Type of Document - pdf; pages: 21. 21 pages, scanned from original on paper to a PDF|
|Contact details of provider:|| Web page: http://184.108.40.206|
When requesting a correction, please mention this item's handle: RePEc:wpa:wuwpge:0509001. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (EconWPA)
If references are entirely missing, you can add them using this form.