On the Existence of Optima in Complete Chains and Lattices

Nikolai Kukushkin ()

Journal of Optimization Theory and Applications, 2012, vol. 154, issue 3, No 2, 759-767

Abstract: Abstract A necessary and sufficient condition for a preference ordering defined on a chain-complete poset to attain its maximum in every subcomplete chain is obtained. A meet-superextremal, or join-superextremal, function on a complete lattice attains its maximum in every subcomplete sublattice if and only if it attains a maximum in every subcomplete chain.

Keywords: Lattice optimization; Complete chain; Complete lattice; Superextremal function (search for similar items in EconPapers)
Date: 2012
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s10957-012-0031-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:joptap:v:154:y:2012:i:3:d:10.1007_s10957-012-0031-8

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1007/s10957-012-0031-8

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().