Multiobjective duality with invexity
From MaRDI portal
The concept of proper efficiency as first defined by Geoffrion is used to construct duality relations between two multiobjective differentiable nonlinear programming problems. Appropriate positive linear combinations of the functions are required to be invex over an appropriate feasible region. Weak duality requires only the invexity of positive linear combinations of the functions. Strong duality results require a constraint qualification, proper efficiency as well as invexity. Strong duality results are established via a parametric programming problem obtained from the primal using a fixed positive weight vector. A kind of converse duality parallelling strict converse duality in single objective nonlinear programming is also given.
Recommendations
- Multiobjective symmetric duality with invexity
- Multiobjective duality with \(\rho-(\eta, \theta)\)-invexity
- Duality for multiobjective variational problems with invexity
- Duality for multiobjective variational problems with invexity
- Duality of invex convex multiobjective programming
- Generalized invexity and duality in multiobjective programming problems
- Duality in multi-objective programming under ratio invexity
- DUALITY OF MULTIOBJECTIVE PROBLEMS
- Optimality criteria and duality in multiple-objective optimization involving generalized invexity
- Generalized invexity and duality in multiple objective variational problems
Cites work
- A duality theorem for non-linear programming
- Converse Duality in Nonlinear Programming
- Convex Transformable Programming Problems and Invexity
- scientific article; zbMATH DE number 446502 (Why is no real title available?)
- scientific article; zbMATH DE number 3856842 (Why is no real title available?)
- scientific article; zbMATH DE number 3308846 (Why is no real title available?)
- On sufficiency of the Kuhn-Tucker conditions
- Proper efficiency and the theory of vector maximization
- Vector and Parametric Programming
- What is invexity?
Cited in
(50)- Optimality conditions and duality for nondifferentiable multiobjective programming problems involving \(d\)-\(r\)-type I functions
- \(d-\rho -(\eta ,\theta )\)-invexity in multiobjective optimization
- On G-invex multiobjective programming. II: Duality
- Duality theorems of vector-valued \(n\)-set functions
- Duality in multiobjective fractional programming involving strongly and weakly invex and related functions
- Pseudo-invexity and duality in nonlinear programming
- On minimax fractional optimality conditions with invexity
- Proper efficiency and generalized nonconvex duality for vector minimization problems
- (p,r)-invexity in multiobjective programming.
- Optimality and duality for generalized fractional programming involving nonsmooth \((F,\rho)\)-convex functions
- Generalized invexity and duality in multiobjective nonlinear programming.
- Nondifferentiable multiobjective programming under generalized d-univexity
- Duality in nonlinear multiobjective programming using augmented Lagrangian functions
- Duality and a characterization of pseudoinvexity for Pareto and weak Pareto solutions in nondifferentiable multiobjective programming
- Generalized (F, )-convexity and duality in nonsmooth problems of multiobjective optimization
- Some results on mathematical programming with generalized ratio invexity
- A new approximation approach to optimality and duality for a class of nonconvex differentiable vector optimization problems
- On sufficiency and duality in multiobjective programming problem under generalized \(\alpha \)-type I univexity
- Strong duality for proper efficiency in vector optimization
- Pseudoinvexity, optimality conditions and efficiency in multiobjective problems; duality
- Multiobjective duality with \(\rho-(\eta, \theta)\)-invexity
- On efficiency in nondifferentiable multiobjective optimization involving pseudo d-univex functions; duality
- Sufficiency criteria and duality in complex nonlinear programming involving pseudoinvex function
- scientific article; zbMATH DE number 446503 (Why is no real title available?)
- Saddle point criteria and duality in multiobjective programming via an η-approximation method
- The efficiency conditions and duality for uniform invex multiobjective program
- Strong Duality with Proper Efficiency in Multiobjective Optimization Involving Nonconvex Set-Valued Maps
- Invex optimisation problems
- scientific article; zbMATH DE number 572159 (Why is no real title available?)
- Nonsmooth Invexity in Multiobjective Programming
- A survey of recent[1985-1995]advances in generalized convexity with applications to duality theory and optimality conditions
- Two types of duality in multiobjective fractional programming
- Proper efficiency conditions and duality for multiobjective programming problems involving semilocally invex functions
- Optimality and duality for multiobjective fractional programming involving nonsmooth(si:Fesi:ρ)–convex functions
- Higher-order duality results for a new class of nonconvex nonsmooth multiobjective programming problems
- Saddle point criteria in semi-infinite minimax fractional programming under \((\Phi,\rho)\)-invexity
- The Notion of V-r-Invexity in Differentiable Multiobjective Programming
- Optimality and duality for multiobjective fractional programming involving nonsmooth pseudoinvex functions
- Multiobjective programming under d-invexity
- Duality and exact penalization for vector optimization via augmented Lagrangian
- Multiobjective optimization problems with modified objective functions and cone constraints and applications
- Saddle points criteria in nondifferentiable multiobjective programming with \(V\)-invex functions via an \(\eta \)-approximation method
- On sufficiency and duality for nonsmooth multiobjective programming problems involving generalized V-r-invex functions
- Proper efficiency conditions and duality results for nonsmooth vector optimization in Banach spaces under (, )-invexity
- Modified ratio objective approach in mathematical programming
- Some nondifferentiable multiobjective programming problems
- Minimax fractional programming under nonsmooth generalized \((\mathcal F,\rho, \theta)\)-d-univexity
- Equivalence and existence of weak Pareto optima for multiobjective optimization problems with cone constraints
- Optimality conditions for a nonconvex set-valued optimization problem
- A characterization of pseudoinvexity for the efficiency in non-differentiable multiobjective problems. Duality
This page was built for publication: Multiobjective duality with invexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1097841)
