Duality in nondifferentiable vector programming
From MaRDI portal
The authors study the saddle point optimality conditions and Lagrange duality in multiobjective optimization for generalized subconvex-like functions. The authors obtain results which will allow them to characterize the solutions for multiobjective programming problems from the saddle point conditions and allow the authors to relate them to the dual problem solutions which will be adequately defined. They also define a new dual problem for the multiobjective programming problem with the special property of being a scalar programing problem.
Recommendations
- Duality theorem of nondifferentiable convex multiobjective programming
- Saddle point and generalized convex duality for multiobjective programming.
- Duality and Lagrange multipliers for nonsmooth multiobjective programming
- Sufficiency and duality in nondifferentiable multiobjective programming
- Optimality conditions, duality and saddle points for nondifferentiable multiobjective fractional programs
Cites work
- \(D\)-invexity and optimality conditions
- A characterization of weakly efficient points
- Alternative theorems and optimality conditions with weakened convexity
- Duality for nonlinear multiobjective programs: A linearization approach
- Duality for nonlinear multiple-criteria optimization problems
- Duality theory for maximizations with respect to cones
- Duality theory in multiobjective programming
- Duality with generalized convexity
- scientific article; zbMATH DE number 3833720 (Why is no real title available?)
- scientific article; zbMATH DE number 3999687 (Why is no real title available?)
- scientific article; zbMATH DE number 3308846 (Why is no real title available?)
- On duality theory in multiobjective programming
- On efficiency and duality for multiobjective programs
- Pre-invex functions in multiple objective optimization
- Proper efficiency and the theory of vector maximization
- Vector maximisation and lagrange multipliers
Cited in
(16)- A duality relation in nonconvex programming
- Lagrange multipliers and saddle points in multiobjective programming
- Duality and saddle-point type optimality for generalized nonlinear fractional programming.
- Saddle point and generalized convex duality for multiobjective programming.
- Duality in nonconvex vector optimization
- Saddle points optimality criteria and duality for multi-objective E-convex programming problems
- scientific article; zbMATH DE number 3883083 (Why is no real title available?)
- scientific article; zbMATH DE number 3874989 (Why is no real title available?)
- scientific article; zbMATH DE number 3896694 (Why is no real title available?)
- New optimality conditions for nonsmooth control problems
- scientific article; zbMATH DE number 1158088 (Why is no real title available?)
- Integral global optimality conditions and an algorithm for multiobjective problems
- Saddle points and Lagrangian dual problems of vector mapping
- Higher-order optimality conditions in set-valued optimization using Studniarski derivatives and applications to duality
- Duality and saddle-points for convex-like vector optimization problems on real linear spaces
- Vector continuous-time programming without differentiability
This page was built for publication: Duality in nondifferentiable vector programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5945939)
