On multiple objective programming problems with set functions

From MaRDI portal





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.




Cited in
(37)








This page was built for publication: On multiple objective programming problems with set functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1058466)