Lagrange multiplier theorem of multiobjective programming problems with set functions
The authors consider a class of multiobjective programming problems with set functions in which the domination structure does not necessarily contain the nonnegative orthant. First, a generalized Farkas-Minkowski theorem for set functions is proved. As a consequence, a Lagrange multipliers theorem is obtained for the case of single objective programming problems with set functions. Next, with a scalarization proposition, the result is extended to the case of multiobjective programming problems with set functions under the hypotheses of a generalized Slater's constraint qualification and of a restriction to proper efficiency. The authors also relate proper efficient solutions to the zero-like functions associated with the subdifferentials of the set functions involved, which presents a new perspective for a proper efficient solution.
- Lagrange duality in multiobjective fractional programming problems with \(n\)-set functions
- Lagrangian function and duality theory in multiobjective programming with set functions
- On multiple objective programming problems with set functions
- Fenchel duality theorem in multiobjective programming problems with set functions
- Publication:4944835
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- Convex Analysis
- Convex programming with set functions
- Duality theory in multiobjective programming
- Efficiency and proper efficiency in vector maximization with respect to cones
- Epigraphs of convex set functions
- Finitely Additive Measures
- Lagrangian function and duality theory in multiobjective programming with set functions
- On multiple objective programming problems with set functions
- Optimal constrained selection of a measurable subset
- Proper D-solutions of multiobjective programming problems with set functions
- Proper efficiency with respect to cones
- Proper Efficient Points for Maximizations with Respect to Cones
- Theory of multiobjective optimization
- On multiple objective programming problems with set functions
- Lagrangian function and duality theory in multiobjective programming with 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
- Fenchel duality theorem in multiobjective programming problems with set functions
- Efficiency conditions and duality models for multiobjective fractional subset programming problems with generalized \(({\mathcal F},\alpha,\rho,\theta)\)-\(V\)-convex functions
- On minimax fractional programming of generalized convex set functions
- Optimality conditions for multiple objective fractional subset programming with \(({\mathcal F},\alpha,\rho,\theta)\)-V-type-I and related non-convex functions
- Optimality and duality for multiobjective programming involving subdifferentiable set functions
- Approximate Saddle Point and Duality for Multiobjective n-Set Optimization
- APPROXIMATE EFFICIENCY FOR n-SET MULTIOBJECTIVE FRACTIONAL PROGRAMMING
- Optimality conditions for multiple objective fractional subset programming with \((\rho,\sigma,\theta )\)-type-I and related non-convex functions
- The saddle theorem for multiobjective generalized fractional programming problems with set functions
- Duality for multiple objective fractional subset programming with generalized \((\Gamma\mkern-15mu-,\rho,\sigma,\theta)\)-V-Type-I functions
- Lagrange multipliers for multiobjective programs with a general preference
This page was built for publication: Lagrange multiplier theorem of multiobjective programming problems with set functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1176838)
