Optimization theory for n-set functions
From MaRDI portal
The author develops an optimization theory for real-valued functions depending on n sets instead of n real variables. The results consist of differential conditions for local minima, saddle point optimality conditions and a Lagrangian duality. They are based on results of \textit{R. J. T. Morris} [J. Math. Anal. App. 70, No.2, 546-562 (1979; Zbl 0417.49032)], where functions of a single set are investigated, and on proof techniques as in the book by \textit{D. G. Luenberger} [``Optimization by vector space methods (1969; Zbl 0176.127)].
Recommendations
- On the optimality conditions of vector-valued n-set functions
- Properties of solutions of optimization problems for set functions
- The Multiobjective Optimization Problem of Set Function
- scientific article; zbMATH DE number 1757114
- Sufficiency criteria and duality for nonlinear programs involving n-set functions
Cites work
- A Partitioning Problem with Applications in Regional Design
- Duality in mathematical programming of set functions: On Fenchel duality theorem
- Duality Relationships for a Partitioning Problem
- scientific article; zbMATH DE number 3748742 (Why is no real title available?)
- scientific article; zbMATH DE number 3238721 (Why is no real title available?)
- scientific article; zbMATH DE number 3281211 (Why is no real title available?)
- scientific article; zbMATH DE number 3305564 (Why is no real title available?)
- scientific article; zbMATH DE number 3399886 (Why is no real title available?)
- IX. On the problem of the most efficient tests of statistical hypotheses
- On multiple objective programming problems with set functions
- On the Fundamental Lemma of Neyman and Pearson
- Optimal constrained selection of a measurable subset
- Saddle point and duality in the optimization theory of convex set functions
- The Multiobjective Optimization Problem of Set Function
Cited in
(48)- Minimax fractional programming for n-set functions and mixed-type duality under generalized Invexity
- Duality theorems of vector-valued \(n\)-set functions
- On the optimality conditions of vector-valued n-set functions
- On the optimality of differentiable nonconvex n-set functions
- Optimality and duality for multiobjective fractional programming involving \(n\)-set functions
- Duality for a minimax programming problem containing n-set functions
- Lagrange duality in multiobjective fractional programming problems with \(n\)-set functions
- Alternative theorems and saddlepoint results for convex programming problems of set functions with values in ordered vector spaces
- Optimality conditions for multiobjective programming with generalized \(({\mathfrak J},\rho,\theta)\)-convex set functions
- Duality for minmax \(B\)-vex programming involving \(n\)-set functions
- On optimality and duality for multiobjective programming problems involving generalized d-type-I and related n-set functions.
- Efficiency conditions and duality models for multiobjective fractional subset programming problems with generalized \(({\mathcal F},\alpha,\rho,\theta)\)-\(V\)-convex functions
- Sufficient efficiency criteria in multiobjective fractional programming with generalized \(( \mathcal {F},b,\phi ,\rho ,\theta ) \)-univex \(n\)-set functions
- Parameter-free sufficient optimality conditions and duality models for minmax fractional subset programming problems with generalized ( F,,) -convex functions
- On minimax fractional programming of generalized convex set functions
- Generalized V-univexity type-I for multiobjective programming with n-set functions
- Duality for generalized fractional programs involving n-set functions
- Set function optimization
- About asymptotic analysis and set optimization
- Optimality conditions for multiple objective fractional subset programming with \(({\mathcal F},\alpha,\rho,\theta)\)-V-type-I and related non-convex functions
- Sufficiency in multiobjective subset programming involving generalized type-I functions
- Optimality and duality for a multi-objective programming problem involving generalized \(d\)-type-I and related \(n\)-set functions
- Set Optimization—A Rather Short Introduction
- Optimality conditions and duality for multiobjective measurable subset selection problems
- Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions
- Oil minmax programming problems containing n-set functions
- Multiobjective Fractional Duality Forn-Set Functions
- scientific article; zbMATH DE number 647234 (Why is no real title available?)
- A survey of recent[1985-1995]advances in generalized convexity with applications to duality theory and optimality conditions
- Optimality and duality for multiobjective programming involving subdifferentiable set functions
- Role of ( , , A)-invexity to -optimality conditions for multiple objective fractional programming
- Approximate Saddle Point and Duality for Multiobjective n-Set Optimization
- scientific article; zbMATH DE number 1757114 (Why is no real title available?)
- Second order duality for mathematical programming involving n-set functions
- Optimality for nonlinear programs containingn-set functions
- Duality for multiobjective programming involving n-set functions
- Duality for multiobjective fractional programming involvingn-set functions sup*
- scientific article; zbMATH DE number 2096864 (Why is no real title available?)
- Optimization through dense sets
- APPROXIMATE EFFICIENCY FOR n-SET MULTIOBJECTIVE FRACTIONAL PROGRAMMING
- Properties of solutions of optimization problems for set functions
- On a general duality model in multiobjective fractional programming with \(n\)-set functions
- Optimality conditions for multiple objective fractional subset programming with \((\rho,\sigma,\theta )\)-type-I and related non-convex functions
- New concepts of generalized convexity in multiobjective subset programming
- Optimality of differentiable, vector-valued n-set functions
- Sufficiency criteria and duality for nonlinear programs involving n-set functions
- Saddle points and Lagrangian-type duality for discrete minmax fractional subset programming problems with generalized convex functions
- Duality for multiple objective fractional subset programming with generalized \((\Gamma\mkern-15mu-,\rho,\sigma,\theta)\)-V-Type-I functions
This page was built for publication: Optimization theory for n-set functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q752016)
