Infine functions and nonsmooth multiobjective optimization problems

DOI10.1016/j.camwa.2006.02.004zbMath1190.90194OpenAlexW2050775218MaRDI QIDQ2475909

Soghra Nobakhtian

Publication date: 11 March 2008

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2006.02.004

zbMATH Keywords

nonsmooth analysisdualityefficient solutionmultiobjective problemsinfine functions

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)

Related Items (8)

Sufficiency and duality for nonsmooth interval-valued optimization problems via generalized invex-infine functions ⋮ Some relations between minty variational-like inequality problems and vectorial optimization problems in Banach spaces ⋮ \(L\)-invex-infine functions and applications ⋮ Optimality and duality for nonsmooth multiobjective fractional programming with mixed constraints ⋮ Optimality conditions and duality in nonsmooth multiobjective optimization problems ⋮ The combination stretching function technique with simulated annealing algorithm for global optimization ⋮ A characterization of pseudoinvexity for the efficiency in non-differentiable multiobjective problems. Duality ⋮ Necessary and sufficient conditions for (weakly) efficient of non-differentiable multi-objective semi-infinite programming problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimality and duality in nondifferentiable and multiobjective programming under generalized \(d\)-invexity
• The essence of invexity
• On sufficiency of the Kuhn-Tucker conditions
• Invexity and the Kuhn-Tucker theorem
• Optimality criteria and duality in multiple-objective optimization involving generalized invexity
• Sufficiency and duality in multiobjective programming involving generalized \(F\)-convex functions
• Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems
• Infine functions, nonsmooth alternative theorems and vector optimization problems
• \((p,r)\)-invexity in multiobjective programming.
• Optimality and duality in nonsmooth multiobjective optimization involving generalized type I functions
• Proper efficiency and the theory of vector maximization
• Invex multifunctions and duality
• Nonsmooth invexity
• Nondifferentiable optimization by smooth approximations
• Necessary and sufficient conditions in constrained optimization
• Generalised convexity and duality in multiple objective programming
• A duality theorem for non-linear programming
• Invexity in multifunction optimization
• Generalized invexity and duality in multiobjective programming problems
• Sufficiency and duality in multiobjective programming involving generalized \((F,\rho)\)-convexity
• Multiobjective programming under generalized type I invexity
• Multiobjective programming under \(d\)-invexity

This page was built for publication: Infine functions and nonsmooth multiobjective optimization problems