On multiple objective programming problems with set functions

DOI10.1016/0022-247X(85)90055-1zbMath0564.90069OpenAlexW2076017503MaRDI QIDQ1058466

J. Blot

Publication date: 1985

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-247x(85)90055-1

zbMATH Keywords

efficient solutionsmultiple objective programmingconvexity for subsets of sigma-algebrasconvexity of set functionsFarkas-Minkowski theorem

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Convexity of real functions of several variables, generalizations (26B25)

Related Items (33)

Proper D-solutions of multiobjective programming problems with set functions ⋮ Epigraphs of convex set functions ⋮ Convolution of set functions ⋮ Lagrangian function and duality theory in multiobjective programming with set functions ⋮ Oil minmax programming problems containing n-set functions ⋮ The saddle theorem for multiobjective generalized fractional programming problems with set functions ⋮ Optimality conditions for multiple objective fractional subset programming with \(({\mathcal F},\alpha,\rho,\theta)\)-V-type-I and related non-convex functions ⋮ Duality for multiple objective fractional subset programming with generalized \((\Gamma\mkern-15mu-,\rho,\sigma,\theta)\)-V-Type-I functions ⋮ Moreau-Rockafellar type theorem for convex set functions ⋮ On several results about convex set functions ⋮ Optimality for set functions with values in ordered vector spaces ⋮ Multiobjective Fractional Duality Forn-Set Functions ⋮ Generalized convex set functions ⋮ Sufficiency in multiobjective subset programming involving generalized type-I functions ⋮ A survey of recent[1985-1995advances in generalized convexity with applications to duality theory and optimality conditions] ⋮ Lagrange multiplier theorem of multiobjective programming problems with set functions ⋮ Duality theorems of vector-valued \(n\)-set functions ⋮ Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions ⋮ On the optimality of differentiable nonconvex \(n\)-set functions ⋮ Optimality conditions for multiple objective fractional subset programming with \((\rho,\sigma,\theta )\)-type-I and related non-convex functions ⋮ Optimality and duality for a multi-objective programming problem involving generalized \(d\)-type-I and related \(n\)-set functions ⋮ Duality for generalized fractional programs involving n-set functions ⋮ Optimality conditions and duality for multiobjective measurable subset selection problems ⋮ Approximate Saddle Point and Duality for Multiobjective n-Set Optimization ⋮ 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 ⋮ Optimality and duality for multiobjective fractional programming involving \(n\)-set functions ⋮ Optimality for nonlinear programs containingn-set functions ⋮ The Fenchel-Moreau Theorem for Set Functions ⋮ Unnamed Item ⋮ Alternative theorems and saddlepoint results for convex programming problems of set functions with values in ordered vector spaces ⋮ Efficiency conditions and duality models for multiobjective fractional subset programming problems with generalized \(({\mathcal F},\alpha,\rho,\theta)\)-\(V\)-convex functions

Cites Work

• Optimal constrained selection of a measurable subset
• Duality in mathematical programming of set functions: On Fenchel duality theorem
• 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
• Proper efficiency and the theory of vector maximization
• Saddle point and duality in the optimization theory of convex set functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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