Lagrangian function and duality theory in multiobjective programming with set functions
From MaRDI portal
Using the concept of vector-valued Lagrangian functions, we characterize a special class of solutions, D-solutions, of a multiobjective programming problem with set functions in which the domination structure is described by a closed convex cone D. Properties of two perturbation functions, primal map and dual map, are also studied. Results lead to a general duality theorem.
Recommendations
- Lagrange duality in multiobjective fractional programming problems with \(n\)-set functions
- Lagrange multiplier theorem of multiobjective programming problems with set functions
- Duality in nonlinear multiobjective programming using augmented Lagrangian functions
- Duality for multiobjective fractional programming involving \(n\)-set functions
- Fenchel duality theorem in multiobjective programming problems with set functions
Cites work
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- Duality theory in multiobjective programming
- Epigraphs of convex 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 and the theory of vector maximization
Cited in
(16)- Proper D-solutions of multiobjective programming problems with set functions
- Lagrange multiplier theorem of multiobjective programming problems with set functions
- Lagrange duality in multiobjective fractional programming problems with \(n\)-set functions
- Convolution of 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
- Lagrangian duality for multiobjective programming problems in lexicographic order
- Optimality conditions for multiple objective fractional subset programming with \(({\mathcal F},\alpha,\rho,\theta)\)-V-type-I and related non-convex functions
- scientific article; zbMATH DE number 1187297 (Why is no real title available?)
- scientific article; zbMATH DE number 500378 (Why is no real title available?)
- A survey of recent[1985-1995]advances in generalized convexity with applications to duality theory and optimality conditions
- scientific article; zbMATH DE number 1158088 (Why is no real title available?)
- scientific article; zbMATH DE number 222537 (Why is no real title available?)
- Optimality conditions for multiple objective fractional subset programming with \((\rho,\sigma,\theta )\)-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
- Variable preference modeling with ideal-symmetric convex cones
This page was built for publication: Lagrangian function and duality theory in multiobjective programming with set functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1090246)
