
doi: 10.1137/0134018
The properties of efficient (admissible) points of subsets of $R^n $ are discussed in the case when the space is ordered by a convex cone. It is demonstrated that the notion of cone-compactness (a generalization of compactness) is sufficient to guarantee the existence of an efficient point. The relationship between the set of efficient points and the optimal sets of certain linear functions is elucidated in a series of theorems extending previous results, when the underlying set satisfies a weakened convexity assumption (cone-convexity). Geoffrion’s concept of proper efficiency is generalized and after showing that our definition is a valid generalization, the appropriate characterization theorem is established.
Compactness, Mathematical programming, Convex sets in \(n\) dimensions (including convex hypersurfaces), Decision theory
Compactness, Mathematical programming, Convex sets in \(n\) dimensions (including convex hypersurfaces), Decision theory
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 166 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 1% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
