Optimization theory for n-set functions

DOI10.1016/0022-247X(87)90151-XzbMath0715.90096MaRDI QIDQ752016

H. W. Corley

Publication date: 1987

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

zbMATH Keywords

Lagrangian dualitydifferential conditions for local miniman-set functionssaddle point optimality conditions

Mathematics Subject Classification ID

Nonlinear programming (90C30) Programming in abstract spaces (90C48) Duality theory (optimization) (49N15)

Related Items

Saddle points and Lagrangian-type duality for discrete minmax fractional subset programming problems with generalized convex functions ⋮ Oil minmax programming problems containing n-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 ⋮ APPROXIMATE EFFICIENCY FOR n-SET MULTIOBJECTIVE FRACTIONAL PROGRAMMING ⋮ 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 ⋮ 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. ⋮ Role of \((\rho , \eta , A)\)-invexity to \(\varepsilon \)-optimality conditions for multiple objective fractional programming ⋮ 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 ⋮ 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 ⋮ 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 ⋮ 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 ⋮ Unnamed Item ⋮ Lagrange duality in multiobjective fractional programming problems with \(n\)-set functions ⋮ Duality for multiobjective programming involving n-set functions ⋮ Duality for multiobjective fractional programming involvingn-set functions sup^* ⋮ 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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal constrained selection of a measurable subset
• Duality in mathematical programming of set functions: On Fenchel duality theorem
• On multiple objective programming problems with set functions
• The Multiobjective Optimization Problem of Set Function
• Saddle point and duality in the optimization theory of convex set functions
• IX. On the problem of the most efficient tests of statistical hypotheses
• Duality Relationships for a Partitioning Problem
• A Partitioning Problem with Applications in Regional Design
• On the Fundamental Lemma of Neyman and Pearson