Optimization problems for set functions
From MaRDI portal
Summary: This paper gives the formal definition of a class of optimization problems, that is, problems of finding conditional extrema of given set-measurable functions. It also formulates the generalization of Lyapunov convexity theorem which is used in the proof of first order optimality conditions for the mentioned class of optimization problems.
Recommendations
Cited in
(10)- Some equivalent problems in set optimization
- About asymptotic analysis and set optimization
- Set Optimization—A Rather Short Introduction
- On some classes of optimization problems on a set of allocations and their properties
- How to divide a territory? A new simple differential formalism for optimization of set functions
- scientific article; zbMATH DE number 592622 (Why is no real title available?)
- scientific article; zbMATH DE number 1757114 (Why is no real title available?)
- scientific article; zbMATH DE number 2096864 (Why is no real title available?)
- Optimization through dense sets
- Properties of solutions of optimization problems for set functions
This page was built for publication: Optimization problems for set functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5954794)