Proper D-solutions of multiobjective programming problems with set functions
From MaRDI portal
Publication:1078090
DOI10.1007/BF00939217zbMath0595.90084MaRDI QIDQ1078090
Publication date: 1987
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Related Items (18)
Lagrangian function and duality theory in multiobjective programming with set 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 ⋮ Generalized convex set 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 ⋮ Duality theorems of vector-valued \(n\)-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 ⋮ 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 ⋮ Duality for generalized fractional programs involving n-set functions ⋮ Approximate Saddle Point and Duality for Multiobjective n-Set Optimization ⋮ Sufficiency criteria and duality for nonlinear programs involving n-set functions ⋮ Lagrange duality in multiobjective fractional programming problems with \(n\)-set functions ⋮ 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
- Optimal constrained selection of a measurable subset
- On multiple objective 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
- Second order optimality conditions for mathematical prograramming with set functions
- Saddle point and duality in the optimization theory of convex set functions
- Unnamed Item
- Unnamed Item
This page was built for publication: Proper D-solutions of multiobjective programming problems with set functions
