Lagrangian function and duality theory in multiobjective programming with set functions
From MaRDI portal
Publication:1090246
DOI10.1007/BF00938538zbMath0619.90072MaRDI QIDQ1090246
Publication date: 1988
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Related Items
Convolution of 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, A survey of recent[1985-1995advances in generalized convexity with applications to duality theory and optimality conditions], Lagrange multiplier theorem of multiobjective programming problems with set functions, Variable preference modeling with ideal-symmetric convex cones, Optimality conditions for multiple objective fractional subset programming with \((\rho,\sigma,\theta )\)-type-I and related non-convex functions, Lagrangian duality for multiobjective programming problems in lexicographic order, Lagrange duality in multiobjective fractional programming problems with \(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
- Optimal constrained selection of a measurable subset
- On multiple objective programming problems with set functions
- Proper D-solutions of multiobjective programming problems with set functions
- Epigraphs of convex set functions
- Duality theory in multiobjective programming
- Proper efficiency and the theory of vector maximization
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
