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

G. J. Zalmai

Publication date: 1990

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




Related Items (21)

Saddle points and Lagrangian-type duality for discrete minmax fractional subset programming problems with generalized convex functionsOptimality conditions for multiple objective fractional subset programming with \(({\mathcal F},\alpha,\rho,\theta)\)-V-type-I and related non-convex functionsDuality for multiple objective fractional subset programming with generalized \((\Gamma\mkern-15mu-,\rho,\sigma,\theta)\)-V-Type-I functionsMultiobjective Fractional Duality Forn-Set FunctionsOptimality conditions for multiobjective programming with generalized \(({\mathfrak J},\rho,\theta)\)-convex set functionsDuality for minmax \(B\)-vex programming involving \(n\)-set functionsA note on fractional minmax programs containing \(n\)-set functionsOptimality conditions and duality results in Banach space under \(\rho -(\eta, \theta)\)-\(B\)-invexitySufficiency in multiobjective subset programming involving generalized type-I functionsA 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 functionsOptimality conditions for multiple objective fractional subset programming with \((\rho,\sigma,\theta )\)-type-I and related non-convex functionsOptimality and duality for a multi-objective programming problem involving generalized \(d\)-type-I and related \(n\)-set functionsGeneralized V-univexity type-I for multiobjective programming with \(n\)-set functionsPartial vector invexity for \(n\)-set functions and minmax programmingDuality for a minimax programming problem containing \(n\)-set functionsParameter-free sufficient optimality conditions and duality models for minmax fractional subset programming problems with generalized \((\mathcal F,\rho,\theta)\) -convex functionsUnnamed ItemLagrange duality in multiobjective fractional programming problems with \(n\)-set functionsDuality for multiobjective programming involving n-set functionsEfficiency 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: Sufficiency criteria and duality for nonlinear programs involving n-set functions