Generalized convex set functions
From MaRDI portal
Publication:1122501
DOI10.1016/0022-247X(89)90222-9zbMath0675.90081MaRDI QIDQ1122501
Publication date: 1989
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Sensitivity, stability, parametric optimization (90C31) Nonsmooth analysis (49J52) Set-valued maps in general topology (54C60) Convexity of real functions of several variables, generalizations (26B25)
Related Items (5)
Saddle points and Lagrangian-type duality for discrete minmax fractional subset programming problems with generalized convex functions ⋮ On a general duality model in multiobjective fractional programming with \(n\)-set functions ⋮ Duality theorems for convex and quasiconvex set functions ⋮ Parameter-free sufficient optimality conditions and duality models for minmax fractional subset programming problems with generalized \((\mathcal F,\rho,\theta)\) -convex functions ⋮ Efficiency conditions and duality models for multiobjective fractional subset programming problems with generalized \(({\mathcal F},\alpha,\rho,\theta)\)-\(V\)-convex functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal constrained selection of a measurable subset
- On multiple objective programming problems with set functions
- Proper D-solutions of multiobjective programming problems with set functions
- Epigraphs of convex set functions
- 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
- Second order optimality conditions for mathematical prograramming with set functions
- Saddle point and duality in the optimization theory of convex set functions
- Pseudo-Convex Functions
This page was built for publication: Generalized convex set functions