| Article ID: | iaor20124807 |
| Volume: | 154 |
| Issue: | 3 |
| Start Page Number: | 759 |
| End Page Number: | 767 |
| Publication Date: | Sep 2012 |
| Journal: | Journal of Optimization Theory and Applications |
| Authors: | Kukushkin Nikolai |
| Keywords: | programming: multiple criteria |
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.