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

DOI10.1016/J.MCM.2011.01.034MaRDI QIDQ646046zbMATH OpenOpenAlexFDO

Authors Tadeusz Antczak

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 solutionvector \(G\)-invex function with respect to \(\eta \)

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

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

Cites work

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

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)