Pages that link to "Item:Q755142"
From MaRDI portal
The following pages link to Optimal constrained selection of a measurable subset (Q755142):
Displayed 50 items.
- On a general duality model in multiobjective fractional programming with \(n\)-set functions (Q646115) (← links)
- Optimality conditions for multiple objective fractional subset programming with \((\rho,\sigma,\theta )\)-type-I and related non-convex functions (Q695624) (← links)
- Optimality of differentiable, vector-valued n-set functions (Q750864) (← links)
- Optimization theory for n-set functions (Q752016) (← links)
- Sufficiency criteria and duality for nonlinear programs involving n-set functions (Q752017) (← links)
- Duality in mathematical programming of set functions: On Fenchel duality theorem (Q787472) (← links)
- Saddle points and Lagrangian-type duality for discrete minmax fractional subset programming problems with generalized convex functions (Q819625) (← links)
- The saddle theorem for multiobjective generalized fractional programming problems with set functions (Q854429) (← links)
- Duality for multiple objective fractional subset programming with generalized \((\Gamma\mkern-15mu-,\rho,\sigma,\theta)\)-V-Type-I functions (Q858577) (← links)
- On several results about convex set functions (Q864657) (← links)
- Minimax fractional programming for \(n\)-set functions and mixed-type duality under generalized Invexity (Q1014021) (← links)
- On multiple objective programming problems with set functions (Q1058466) (← links)
- Proper D-solutions of multiobjective programming problems with set functions (Q1078090) (← links)
- Epigraphs of convex set functions (Q1080171) (← links)
- Lagrangian function and duality theory in multiobjective programming with set functions (Q1090246) (← links)
- Moreau-Rockafellar type theorem for convex set functions (Q1110462) (← links)
- Optimality for set functions with values in ordered vector spaces (Q1115816) (← links)
- Generalized convex set functions (Q1122501) (← links)
- Lagrange multiplier theorem of multiobjective programming problems with set functions (Q1176838) (← links)
- Duality theorems of vector-valued \(n\)-set functions (Q1179369) (← links)
- On the optimality conditions of vector-valued \(n\)-set functions (Q1189678) (← links)
- On the optimality of differentiable nonconvex \(n\)-set functions (Q1206856) (← links)
- Optimality and duality for multiobjective fractional programming involving \(n\)-set functions (Q1269682) (← links)
- Duality for a minimax programming problem containing \(n\)-set functions (Q1279952) (← links)
- On abstract \(JW\)-algebras (Q1288058) (← links)
- Lagrange duality in multiobjective fractional programming problems with \(n\)-set functions (Q1304681) (← links)
- Extensions of the optimal partition problem for a measure space (Q1316923) (← links)
- Alternative theorems and saddlepoint results for convex programming problems of set functions with values in ordered vector spaces (Q1320449) (← links)
- Convolution of set functions (Q1331462) (← links)
- Optimality conditions for multiobjective programming with generalized \(({\mathfrak J},\rho,\theta)\)-convex set functions (Q1378572) (← links)
- Duality for minmax \(B\)-vex programming involving \(n\)-set functions (Q1378590) (← links)
- On optimality and duality for multiobjective programming problems involving generalized \(d\)-type-I and related \(n\)-set functions. (Q1404898) (← links)
- Fenchel duality theorem in multiobjective programming problems with set functions (Q1429341) (← links)
- Efficiency conditions and duality models for multiobjective fractional subset programming problems with generalized \(({\mathcal F},\alpha,\rho,\theta)\)-\(V\)-convex functions (Q1609081) (← links)
- Sufficient efficiency criteria in multiobjective fractional programming with generalized \(( \mathcal {F},b,\phi ,\rho ,\theta ) \)-univex \(n\)-set functions (Q1677287) (← links)
- Parameter-free sufficient optimality conditions and duality models for minmax fractional subset programming problems with generalized \((\mathcal F,\rho,\theta)\) -convex functions (Q1827235) (← links)
- On minimax fractional programming of generalized convex set functions (Q1978809) (← links)
- Duality theorems for convex and quasiconvex set functions (Q2225642) (← links)
- Generalized V-univexity type-I for multiobjective programming with \(n\)-set functions (Q2271161) (← links)
- Duality for generalized fractional programs involving n-set functions (Q2276888) (← links)
- Optimality conditions for multiple objective fractional subset programming with \(({\mathcal F},\alpha,\rho,\theta)\)-V-type-I and related non-convex functions (Q2389822) (← links)
- Sufficiency in multiobjective subset programming involving generalized type-I functions (Q2426681) (← links)
- Optimality and duality for a multi-objective programming problem involving generalized \(d\)-type-I and related \(n\)-set functions (Q2496067) (← links)
- Optimality conditions and duality for multiobjective measurable subset selection problems (Q3363067) (← links)
- The Multiobjective Optimization Problem of Set Function (Q3707775) (← links)
- The Fenchel-Moreau Theorem for Set Functions (Q3788604) (← links)
- Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions (Q3833882) (← links)
- Oil minmax programming problems containing n-set functions (Q3978528) (← links)
- Methods of finding optimal submeasures (characterization of solutions) (Q4205238) (← links)
- Multiobjective Fractional Duality For<i>n</i>-Set Functions (Q4298550) (← links)