Optimization problems for set functions
Slawomir Dorosiewicz
International Journal of Mathematics and Mathematical Sciences · 2001
doi:10.1155/s0161171201005476 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
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.
Abstract licence: CC BY
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.