Optimal constrained selection of a measurable subset

Numerical optimization and variational techniques (65K10) Methods involving semicontinuity and convergence; relaxation (49J45) Optimality conditions (49K99) Mathematical programming (90C99)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Multiplier methods: A survey
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
Convexity and Mixtures
Title not available (Why is that?)
Title not available (Why is that?)

Cited In (59)

APPROXIMATE EFFICIENCY FOR n-SET MULTIOBJECTIVE FRACTIONAL PROGRAMMING
Methods of finding optimal submeasures (characterization of solutions)
Title not available (Why is that?)
Saddle points and Lagrangian-type duality for discrete minmax fractional subset programming problems with generalized convex functions
Duality for generalized fractional programs involving n-set functions
Optimality conditions for multiple objective fractional subset programming with \((\rho,\sigma,\theta )\)-type-I and related non-convex functions
Duality for minmax \(B\)-vex programming involving \(n\)-set functions
Optimality of differentiable, vector-valued 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
Minimax fractional programming for \(n\)-set functions and mixed-type duality under generalized Invexity
The Fenchel-Moreau Theorem for Set Functions
Generalized V-univexity type-I for multiobjective programming with \(n\)-set functions
On multiple objective programming problems with set functions
Proper D-solutions of multiobjective programming problems with set functions
Lagrangian function and duality theory in multiobjective programming with set functions
Optimality for set functions with values in ordered vector spaces
Duality theorems of vector-valued \(n\)-set functions
Lagrange multiplier theorem of multiobjective programming problems with set functions
The saddle theorem for multiobjective generalized fractional programming problems with set functions
Duality for a minimax programming problem containing \(n\)-set functions
Alternative theorems and saddlepoint results for convex programming problems of set functions with values in ordered vector spaces
On several results about convex set functions
On abstract \(JW\)-algebras
Approximate Saddle Point and Duality for Multiobjective n-Set Optimization
Lagrange duality in multiobjective fractional programming problems with \(n\)-set functions
Optimality for nonlinear programs containingn-set functions
Parameter-free sufficient optimality conditions and duality models for minmax fractional subset programming problems with generalized \((\mathcal F,\rho,\theta)\) -convex functions
Optimization theory for n-set functions
Fenchel duality theorem in multiobjective programming problems with set functions
Oil minmax programming problems containing n-set functions
On optimality and duality for multiobjective programming problems involving generalized \(d\)-type-I and related \(n\)-set functions.
Multiobjective Fractional Duality Forn-Set Functions
Optimality conditions for multiple objective fractional subset programming with \(({\mathcal F},\alpha,\rho,\theta)\)-V-type-I and related non-convex functions
Extensions of the optimal partition problem for a measure space
Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions
Optimality conditions for multiobjective programming with generalized \(({\mathfrak J},\rho,\theta)\)-convex set functions
On the optimality conditions of vector-valued \(n\)-set functions
Duality for multiobjective fractional programming involvingn-set functions sup^*
Duality in mathematical programming of set functions: On Fenchel duality theorem
Duality theorems for convex and quasiconvex set functions
Methods of finding optimal submeasures (characterization of solutions)
Efficiency conditions and duality models for multiobjective fractional subset programming problems with generalized \(({\mathcal F},\alpha,\rho,\theta)\)-\(V\)-convex functions
Epigraphs of convex set functions
Sufficient efficiency criteria in multiobjective fractional programming with generalized \(( \mathcal {F},b,\phi ,\rho ,\theta ) \)-univex \(n\)-set functions
Moreau-Rockafellar type theorem for convex set functions
Convolution of set functions
On minimax fractional programming of generalized convex set functions
Optimality and duality for a multi-objective programming problem involving generalized \(d\)-type-I and related \(n\)-set functions
On a general duality model in multiobjective fractional programming with \(n\)-set functions
The Multiobjective Optimization Problem of Set Function
Optimality conditions and duality for multiobjective measurable subset selection problems
Duality for multiple objective fractional subset programming with generalized \((\Gamma\mkern-15mu-,\rho,\sigma,\theta)\)-V-Type-I functions
Generalized convex set functions
On the optimality of differentiable nonconvex \(n\)-set functions
A survey of recent[1985-1995]advances in generalized convexity with applications to duality theory and optimality conditions
Duality for multiobjective programming involving n-set functions
Optimality and duality for multiobjective programming involving subdifferentiable set functions
Sufficiency in multiobjective subset programming involving generalized type-I functions

This page was built for publication: Optimal constrained selection of a measurable subset

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q755142)