Lagrange multiplier theorem of multiobjective programming problems with set functions

DOI10.1007/BF00940508zbMath0741.90058MaRDI QIDQ1176838

S. Singh

Publication date: 25 June 1992

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

Lagrange multipliers; multiobjective programming; subdifferentials; proper efficiency; set functions

Mathematics Subject Classification ID

90C29: Multi-objective and goal programming

26E25: Set-valued functions

Related Items

Optimality and duality for multiobjective programming involving subdifferentiable set functions, Duality for a minimax programming problem containing \(n\)-set functions, Lagrange duality in multiobjective fractional programming problems with \(n\)-set functions, Optimality conditions for multiobjective programming with generalized \(({\mathfrak J},\rho,\theta)\)-convex set functions, On minimax fractional programming of generalized convex set functions

Cites Work

• Optimal constrained selection of a measurable subset
• Efficiency and proper efficiency in vector maximization with respect to cones
• On multiple objective programming problems with set functions
• Theory of multiobjective optimization
• Proper D-solutions of multiobjective programming problems with set functions
• Epigraphs of convex set functions
• Lagrangian function and duality theory in multiobjective programming with set functions
• Convex programming with set functions
• Proper efficiency with respect to cones
• Duality theory in multiobjective programming
• Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
• Proper Efficient Points for Maximizations with Respect to Cones
• Convex Analysis
• Finitely Additive Measures