Optimality conditions in multiobjective differentiable programming
From MaRDI portal
Necessary conditions not requiring convexity are based on the convergence of a vector at a point and on Motzkin's theorem of the alternative. A constraint qualification is also involved in the establishment of necessary conditions. Three theorems on sufficiency require various levels of convexity on the component of the functions involved, and the equality constraints are not necessarily linear. Scalarization of the objective function is used only in the last sufficiency theorem.
Recommendations
Cites work
- scientific article; zbMATH DE number 3121281 (Why is no real title available?)
- scientific article; zbMATH DE number 3790227 (Why is no real title available?)
- scientific article; zbMATH DE number 3490676 (Why is no real title available?)
- scientific article; zbMATH DE number 3308846 (Why is no real title available?)
- Maximal vectors and multi-objective optimization
- Saddlepoint Theory for Nondifferentiable Multiobjective Fractional Programming
Cited in
(73)- On G-invex multiobjective programming. II: Duality
- On G-invex multiobjective programming. I: Optimality
- Optimality and duality for nonsmooth multiobjective programming problems with \(V\)-\(r\)-invexity
- Two optimality tests for differentiable concave value functions in linear multi-objective programming problems
- Second-order optimality conditions in multiobjective optimization problems
- Regularity conditions in vector optimization
- Approximate necessary conditions for locally weak Pareto optimality
- Optimality conditions in differentiable multiobjective programming
- (p,r)-invexity in multiobjective programming.
- The generalized optimality conditions of multiobjective programming problem in topological vector space.
- On first order optimality conditions for vector optimization
- A finite dimensional extension of Lyusternik theorem with applications to multiobjective optimization
- Second-order optimality conditions for multiobjective optimization whose order induced by second-order cone
- Infinite-horizon multiobjective optimal control problems for bounded processes
- Second-order optimality conditions for cone constrained multi-objective optimization
- Multiobjective scatter search for a commercial territory design problem
- Sufficiency and duality in differentiable multiobjective programming involving generalized type I functions
- On weak and strong Kuhn-Tucker conditions for smooth multiobjective optimization
- Sufficiency and duality in multiobjective fractional programming problems involving generalized type I functions
- Constraint qualifications for Karush-Kuhn-Tucker conditions in multiobjective optimization
- A new approximation approach to optimality and duality for a class of nonconvex differentiable vector optimization problems
- Optimality conditions and Mond-Weir duality for a class of differentiable semi-infinite multiobjective programming problems with vanishing constraints
- New results on second-order optimality conditions in vector optimization problems
- Constrained \(\epsilon\)-vector valued games and generalized multi-valued \(\epsilon\)-minmax, \(\epsilon\)-maxmin programming.
- Multiobjective fractional programming problems involving \((p,r)\)-\(\rho\)-\((\eta,\theta)\)-invex function
- Geometrical characterization of weakly efficient points
- An \(\eta\)-approximation method in nonlinear vector optimization
- The envelope theorem for multiobjective convex programming via contingent derivatives
- \(V-E\)-invexity in \(E\)-differentiable multiobjective programming
- SUFFICIENT OPTIMALITY CONDITIONS AND DUALITY IN MULTIOBJECTIVE OPTIMIZATION INVOLVING GENERALIZED CONVEXITY
- Multiplier rules for weak pareto optimization problems
- On Proper Efficiency in Multiobjective Semi-infinite Optimization
- Infinite horizon multiobjective optimal control problems in the discrete time case
- FIRST AND SECOND ORDER SUFFICIENT CONDITIONS FOR STRICT MINIMALITY IN MULTIOBJECTIVE PROGRAMMING
- scientific article; zbMATH DE number 4202032 (Why is no real title available?)
- Saddle point criteria and duality in multiobjective programming via an η-approximation method
- AN η-APPROXIMATION APPROACH IN NONLINEAR VECTOR OPTIMIZATION WITH UNIVEX FUNCTIONS
- CONE CONVEX AND RELATED FUNCTIONS IN OPTIMIZATION OVER TOPOLOGICAL VECTOR SPACES
- First order optimality conditions in vector optimization involving stable functions
- AN η-APPROXIMATION METHOD FOR NONSMOOTH MULTIOBJECTIVE PROGRAMMING PROBLEMS
- Multiobjective Problems with Nonsmooth Equality Constraints
- Nonsmooth multiobjective programming: strong Kuhn-Tucker conditions
- Optimality Conditions in Multiobjective Optimization Problems
- Second-order necessary and sufficient conditions in multiobjective programming∗
- scientific article; zbMATH DE number 123793 (Why is no real title available?)
- scientific article; zbMATH DE number 179184 (Why is no real title available?)
- A survey of recent[1985-1995]advances in generalized convexity with applications to duality theory and optimality conditions
- Optimality Conditions in Directionally Differentiable Pareto Problems with a Set Constraint via Tangent Cones
- scientific article; zbMATH DE number 1779286 (Why is no real title available?)
- Duality in nonconvex vector minimum problems
- scientific article; zbMATH DE number 4119966 (Why is no real title available?)
- Optimality and Duality for Invex Nonsmooth Multiobjective programming problems
- Proper efficiency and proper Karush-Kuhn-Tucker conditions for smooth multiobjective optimization problems
- scientific article; zbMATH DE number 883239 (Why is no real title available?)
- A necessary and sufficient constraint qualification for sufficient optimality conditions in differentiable programming
- Strong and weak conditions of regularity and optimality
- Global efficiency for multiobjective bilevel programming problems under generalized invexity
- On vector generalized semi-infinite programming
- scientific article; zbMATH DE number 223253 (Why is no real title available?)
- The Notion of V-r-Invexity in Differentiable Multiobjective Programming
- Optimality and duality forV-invex non-smooth multiobjective programming problems
- Counterexample and optimality conditions in differentiable multiobjective programming
- On a gap between multiobjective optimization and scalar optimization
- Generalized polarity and weakest constraint qualifications in multiobjective optimization
- Dini and Hadamard directional derivatives in multiobjective optimization: an overview of some results
- On efficiency and duality for a class of nonconvex nondifferentiable multiobjective fractional variational control problems
- On directionally differentiable multiobjective programming problems with vanishing constraints
- Characterization of vector strict global minimizers of order 2 in differentiable vector optimization problems under a new approximation method
- A new characterization of (weak) Pareto optimality for differentiable vector optimization problems with G-invex functions
- On optimality and duality in nonsmooth vector fractional continuous-time programming: strengthened conditions for mixed-affine models
- Optimality analysis for nonsmooth vector equilibrium problems with constraints via generalized subdifferentials
- A gap between multiobjective optimization and scalar optimization
- Optimality conditions and duality in nonsmooth multiobjective programs
This page was built for publication: Optimality conditions in multiobjective differentiable programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1076613)