Optimal constrained selection of a measurable subset
From MaRDI portal
Publication:755142
DOI10.1016/0022-247X(79)90064-7zbMath0417.49032MaRDI QIDQ755142
Publication date: 1979
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Numerical optimization and variational techniques (65K10) Methods involving semicontinuity and convergence; relaxation (49J45) Mathematical programming (90C99) Optimality conditions (49K99)
Related Items (59)
Saddle points and Lagrangian-type duality for discrete minmax fractional subset programming problems with generalized convex functions ⋮ Proper D-solutions of multiobjective programming problems with set functions ⋮ Epigraphs of convex set functions ⋮ Convolution of set functions ⋮ The Multiobjective Optimization Problem of Set Function ⋮ 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 ⋮ APPROXIMATE EFFICIENCY FOR n-SET MULTIOBJECTIVE FRACTIONAL PROGRAMMING ⋮ On several results about convex set functions ⋮ Optimality for set functions with values in ordered vector spaces ⋮ Multiobjective Fractional Duality Forn-Set Functions ⋮ Optimality conditions for multiobjective programming with generalized \(({\mathfrak J},\rho,\theta)\)-convex set functions ⋮ Duality for minmax \(B\)-vex programming involving \(n\)-set functions ⋮ Generalized convex set functions ⋮ Sufficient efficiency criteria in multiobjective fractional programming with generalized \(( \mathcal {F},b,\phi ,\rho ,\theta ) \)-univex \(n\)-set functions ⋮ Sufficiency in multiobjective subset programming involving generalized type-I functions ⋮ On optimality and duality for multiobjective programming problems involving generalized \(d\)-type-I and related \(n\)-set functions. ⋮ A survey of recent[1985-1995advances in generalized convexity with applications to duality theory and optimality conditions] ⋮ On a general duality model in multiobjective fractional programming with \(n\)-set functions ⋮ Optimality and duality for multiobjective programming involving subdifferentiable set functions ⋮ Fenchel duality theorem in multiobjective programming problems with set functions ⋮ Duality theorems for convex and quasiconvex set functions ⋮ Lagrange multiplier theorem of multiobjective programming problems with set functions ⋮ Duality theorems of vector-valued \(n\)-set functions ⋮ On minimax fractional programming of generalized convex set functions ⋮ On the optimality conditions 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 ⋮ Generalized V-univexity type-I for multiobjective programming with \(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 ⋮ Minimax fractional programming for \(n\)-set functions and mixed-type duality under generalized Invexity ⋮ 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 ⋮ Methods of finding optimal submeasures (characterization of solutions) ⋮ The Fenchel-Moreau Theorem for Set Functions ⋮ Duality for a minimax programming problem containing \(n\)-set functions ⋮ Parameter-free sufficient optimality conditions and duality models for minmax fractional subset programming problems with generalized \((\mathcal F,\rho,\theta)\) -convex functions ⋮ Methods of finding optimal submeasures (characterization of solutions) ⋮ On abstract \(JW\)-algebras ⋮ Unnamed Item ⋮ Duality in mathematical programming of set functions: On Fenchel duality theorem ⋮ Lagrange duality in multiobjective fractional programming problems with \(n\)-set functions ⋮ On multiple objective programming problems with set functions ⋮ Duality for multiobjective programming involving n-set functions ⋮ Duality for multiobjective fractional programming involvingn-set functions sup* ⋮ Extensions of the optimal partition problem for a measure space ⋮ 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
This page was built for publication: Optimal constrained selection of a measurable subset
