Duality for multiobjective programming involving n-set functions
From MaRDI portal
Publication:4764884
DOI10.1080/02331939408843935zbMath0819.90084OpenAlexW1990473136MaRDI QIDQ4764884
Cheong Lai Jo, Do Sang Kim, Gue Myung Lee
Publication date: 1994
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939408843935
optimality conditionsefficiencyduality theoremsgeneralized \(\rho\)-convexityvector valued \(n\)-set functions
Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Convexity of real functions of several variables, generalizations (26B25)
Related Items (10)
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 ⋮ Optimality conditions for multiobjective programming with generalized \(({\mathfrak J},\rho,\theta)\)-convex set functions ⋮ 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 for nonlinear programs containingn-set functions ⋮ Unnamed Item ⋮ Efficiency conditions and duality models for multiobjective fractional subset programming problems with generalized \(({\mathcal F},\alpha,\rho,\theta)\)-\(V\)-convex functions
Cites Work
- 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
- Optimal constrained selection of a measurable subset
- On various duality theorems in nonlinear programming
- Duality theorems of vector-valued \(n\)-set functions
- On the optimality conditions of vector-valued \(n\)-set functions
- Efficiency and generalized convex duality for multiobjective programs
- Optimality conditions and duality for multiobjective measurable subset selection problems
This page was built for publication: Duality for multiobjective programming involving n-set functions