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.
Recommendations
Cites work
- Application de la méthode des éléments finis à l'approximation d'un problème de domaine optimal. Méthodes de résolution des problèmes approches
- Duality in mathematical programming of set functions: On Fenchel duality theorem
- scientific article; zbMATH DE number 3580375 (Why is no real title available?)
- scientific article; zbMATH DE number 3225772 (Why is no real title available?)
- scientific article; zbMATH DE number 3334123 (Why is no real title available?)
- scientific article; zbMATH DE number 3069614 (Why is no real title available?)
- Optimal constrained selection of a measurable subset
- Proper efficiency and the theory of vector maximization
- Saddle point and duality in the optimization theory of convex set functions
Cited in
(37)- Proper D-solutions of multiobjective programming problems with set functions
- Epigraphs of convex set functions
- Lagrangian function and duality theory in multiobjective programming with set functions
- Moreau-Rockafellar type theorem for convex set functions
- Optimality for set functions with values in ordered vector spaces
- Generalized convex set functions
- Lagrange multiplier theorem of multiobjective programming problems with set functions
- Duality theorems 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
- Alternative theorems and saddlepoint results for convex programming problems of set functions with values in ordered vector spaces
- Convolution of set functions
- Derived sets in multiobjective optimization
- Efficiency conditions and duality models for multiobjective fractional subset programming problems with generalized \(({\mathcal F},\alpha,\rho,\theta)\)-\(V\)-convex functions
- Duality for generalized fractional programs involving n-set functions
- 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
- Optimality conditions and duality for multiobjective measurable subset selection problems
- The Multiobjective Optimization Problem of Set Function
- scientific article; zbMATH DE number 3991290 (Why is no real title available?)
- The Fenchel-Moreau Theorem for Set Functions
- 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
- A survey of recent[1985-1995]advances in generalized convexity with applications to duality theory and optimality conditions
- Approximate Saddle Point and Duality for Multiobjective n-Set Optimization
- Second order duality for mathematical programming involving n-set functions
- Optimality for nonlinear programs containingn-set functions
- scientific article; zbMATH DE number 851569 (Why is no real title available?)
- Optimality conditions for multiple objective fractional subset programming with \((\rho,\sigma,\theta )\)-type-I and related non-convex functions
- Optimality of differentiable, vector-valued n-set functions
- Optimization theory for n-set functions
- Sufficiency criteria and duality for nonlinear programs involving n-set functions
- The saddle theorem for multiobjective generalized fractional programming problems with set functions
- Duality for multiple objective fractional subset programming with generalized \((\Gamma\mkern-15mu-,\rho,\sigma,\theta)\)-V-Type-I functions
- On several results about convex set functions
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)