Necessary and sufficient conditions for weak efficiency in non-smooth vectorial optimization problems

DOI10.1080/02331930701763645zbMath1175.90410OpenAlexW2050176600MaRDI QIDQ3648623

Marko A. Rojas-Medar, Rafaela Osuna-Gómez, Adilson J. V. Brandão, Lucelina Batista Dos Santos

Publication date: 27 November 2009

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10533/141199

zbMATH Keywords

weak efficient solutiondirectional generalized derivative\(K\)-invex functioncone approximatenon-smooth vectorial optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Programming in abstract spaces (90C48)

Related Items (4)

New optimality conditions for nonsmooth control problems ⋮ Infinite-horizon multiobjective optimal control problems for bounded processes ⋮ Local cone approximations in mathematical programming ⋮ Infinite horizon multiobjective optimal control problems in the discrete time case

Cites Work

• Unnamed Item
• Optimality criteria in nonlinear programming involving nonconvex functions
• The essence of invexity
• On duality theory in multiobjective programming
• Weak Pareto-optimal necessary conditions in a nondifferentiable multiobjective program on a Banach space
• Pareto optimality in multiobjective problems
• Invex functions and generalized convexity in multiobjective programming
• A theorem of the alternative and its application to the optimization of set-valued maps
• Invexity and the Kuhn-Tucker theorem
• A generalization of the Kuhn-Tucker sufficiency conditions
• Lagrangian multipliers, saddle points, and duality in vector optimization of set-valued maps
• Lagrangian duality for minimization of nonconvex multifunctions
• Infine functions, nonsmooth alternative theorems and vector optimization problems
• Preinvex functions and weak efficient solutions for some vectorial optimization problem in Banach spaces
• Strict lower semicontinuity of the level sets and invexity of a locally Lipschitz function
• Optimality conditions for Pareto nonsmooth nonconvex programming in Banach spaces
• Optimality criteria and duality in multiobjective programming involving nonsmooth invex functions
• Lectures on mathematical theory of extremum problems. Translated from the Russian by D. Louvish
• Abstract cone approximations and generalized differentiability in nonsmooth optimization
• On optimality conditions in nondifferentiable programming
• Invex nonsmooth alternative theorem and applications^*
• Characteruzation of pareto optimal points in problems with mult-eqality constraints
• Optimality conditions for vector optimisation with set-valued maps
• Nonsmooth invex functions and sufficient optimality conditions

This page was built for publication: Necessary and sufficient conditions for weak efficiency in non-smooth vectorial optimization problems