On multiple objective programming problems with set functions (Q1058466)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On multiple objective programming problems with set functions |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On multiple objective programming problems with set functions |
scientific article |
Statements
On multiple objective programming problems with set functions (English)
0 references
1985
0 references
The convexity of a subset of a \(\sigma\)-algebra and the convexity of a set function on a convex subset are defined. Related properties are also examined. A Farkas-Minkowski theorem for set functions is then proved. These results are used to characterize properly efficient solutions for multiple objective programming problems with set functions by associated scalar problems.
0 references
convexity for subsets of sigma-algebras
0 references
convexity of set functions
0 references
Farkas-Minkowski theorem
0 references
efficient solutions
0 references
multiple objective programming
0 references
