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 multipliersmultiobjective programmingsubdifferentialsproper efficiencyset functions

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Set-valued functions (26E25)

Related Items (13)

The saddle theorem for multiobjective generalized fractional programming problems with 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 ⋮ APPROXIMATE EFFICIENCY FOR n-SET MULTIOBJECTIVE FRACTIONAL PROGRAMMING ⋮ Optimality conditions for multiobjective programming with generalized \(({\mathfrak J},\rho,\theta)\)-convex set functions ⋮ Optimality and duality for multiobjective programming involving subdifferentiable set functions ⋮ Fenchel duality theorem in multiobjective programming problems with set functions ⋮ On minimax fractional programming of generalized convex set functions ⋮ Optimality conditions for multiple objective fractional subset programming with \((\rho,\sigma,\theta )\)-type-I and related non-convex functions ⋮ Approximate Saddle Point and Duality for Multiobjective n-Set Optimization ⋮ Duality for a minimax programming problem containing \(n\)-set functions ⋮ 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
• 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

This page was built for publication: Lagrange multiplier theorem of multiobjective programming problems with set functions