Sufficiency criteria and duality for nonlinear programs involving n-set functions
From MaRDI portal
Publication:752017
DOI10.1016/0022-247X(90)90045-HzbMath0715.90097MaRDI QIDQ752017
Publication date: 1990
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Nonlinear programming (90C30) Programming in abstract spaces (90C48) Duality theory (optimization) (49N15) Optimality conditions for problems in abstract spaces (49K27)
Related Items (21)
Saddle points and Lagrangian-type duality for discrete minmax fractional subset programming problems with generalized convex 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 ⋮ 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 ⋮ A note on fractional minmax programs containing \(n\)-set functions ⋮ Optimality conditions and duality results in Banach space under \(\rho -(\eta, \theta)\)-\(B\)-invexity ⋮ Sufficiency in multiobjective subset programming involving generalized type-I functions ⋮ A survey of recent[1985-1995advances in generalized convexity with applications to duality theory and optimality conditions] ⋮ Optimality and duality for multiobjective programming involving subdifferentiable 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 ⋮ Partial vector invexity for \(n\)-set functions and minmax programming ⋮ 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 ⋮ Efficiency conditions and duality models for multiobjective fractional subset programming problems with generalized \(({\mathcal F},\alpha,\rho,\theta)\)-\(V\)-convex functions
Cites Work
- Optimization theory for n-set functions
- 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
- Proper D-solutions of multiobjective programming problems with set functions
- Epigraphs of convex set functions
- Sufficient Fritz John optimality conditions and duality for nonlinear programming problems
- Extreme convex set functions with finite carrier: General theory
- 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
- First and second order fractional programming duality
- Some properties of convex set functions
- Strong and Weak Convexity of Sets and Functions
- Second order optimality conditions for mathematical prograramming 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Sufficiency criteria and duality for nonlinear programs involving n-set functions