A new characterization of (weak) Pareto optimality for differentiable vector optimization problems with \(G\)-invex functions

DOI10.1016/j.mcm.2011.01.034zbMath1225.90161OpenAlexW1969217009MaRDI QIDQ646046

Publication date: 11 November 2011

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mcm.2011.01.034

zbMATH Keywords

multiobjective programming \(\eta \)-approximated vector optimization problem (weak) Pareto optimal solution vector \(G\)-invex function with respect to \(\eta \)

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

A new approximation approach to optimality and duality for a class of nonconvex differentiable vector optimization problems

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
New optimality conditions and duality results of \(G\) type in differentiable mathematical programming
On \(G\)-invex multiobjective programming. II: Duality
On \(G\)-invex multiobjective programming. I: Optimality
Theory of multiobjective optimization
Optimality conditions in multiobjective differentiable programming
A note on invex functions and duality in multiple objective optimization
On sufficiency of the Kuhn-Tucker conditions
Maximal vectors and multi-objective optimization
Pareto optimality in multiobjective problems
Invex functions and generalized convexity in multiobjective programming
Optimality criteria and duality in multiple-objective optimization involving generalized invexity
A characterization of weakly efficient points
Theorems of the alternative and optimality conditions
Scalarizing vector optimization problems
Complex minimax programming under generalized convexity
Characterization of solutions of multiobjective optimization problem
An \(\eta\)-approximation method in nonlinear vector optimization
Scalarization in vector optimization
On duality for weakly minimized vector valued optimization problems
Invex functions and constrained local minima
On generalised convex mathematical programming
Necessary and Sufficient Conditions for a Pareto Optimum in Convex Programming
Quasimin and quasisaddlepoint for vector optimization
Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C¹-Optimization
On lagrange-kuhn-tucker multipliers for pareto optimization problems

This page was built for publication: A new characterization of (weak) Pareto optimality for differentiable vector optimization problems with \(G\)-invex functions