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

DOI10.1016/J.MCM.2011.01.034zbMATH Open1225.90161OpenAlexW1969217009MaRDI QIDQ646046FDOQ646046

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

Recommendations

An \(\eta\)-approximation method in nonlinear vector optimization
scientific article; zbMATH DE number 5879517
AN η-APPROXIMATION METHOD FOR NONSMOOTH MULTIOBJECTIVE PROGRAMMING PROBLEMS
AN η-APPROXIMATION APPROACH IN NONLINEAR VECTOR OPTIMIZATION WITH UNIVEX FUNCTIONS
An \(\eta\)-approximation method for multiobjective program involving invex functions

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)

Cites Work

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

Cited In (3)

A new approximation approach to optimality and duality for a class of nonconvex differentiable vector optimization problems
Characterizations of solvability of nonlinear nonconvex vectorial optimization problems in Banach spaces by \(\eta\)-approximation approach
Characterization of vector strict global minimizers of order 2 in differentiable vector optimization problems under a new approximation method

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q646046)