Sufficiency in nonsmooth multiobjective programming involving generalized ( F, )-convexity

DOI10.1007/S10957-006-9105-9MaRDI QIDQ868552zbMATH OpenOpenAlexFDO

Authors S. Nobakhtian

Publication date 6 March 2007

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10957-006-9105-9

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonconvex programming, global optimization (90C26) Nonsmooth analysis (49J52)

Cites work

• scientific article; zbMATH DE number 1113627 (Why is no real title available?)
• Further Generalizations of Convexity in Mathematical Programming
• Generalized (F, ρ)-convexity and duality for non smooth multi-objective programs
• On efficiency and duality for multiobjective programs
• On sufficiency and duality for generalised quasicnvex nonsmooth programs
• Optimality conditions and duality in subdifferentiable multiobjective fractional programming
• Optimization and nonsmooth analysis
• Proper efficiency and the theory of vector maximization
• Strong and Weak Convexity of Sets and Functions
• Strong convexity of sets and functions
• Sufficiency and duality in multiobjective programming involving generalized \((F,\rho)\)-convexity
• Sufficiency and duality in multiobjective programming involving generalized \(F\)-convex functions
• Vector-valued lagrangian and multiobjective fractional programming duality

Cited in

(5)

• Optimality and duality in vector optimization involving generalized type I functions over cones
• SUFFICIENCY IN NONSMOOTH MULTIOBJECTIVE FRACTIONAL PROGRAMMING
• On quasidifferentiable mathematical programs with equilibrium constraints
• Necessary and sufficient conditions for (weakly) efficient of non-differentiable multi-objective semi-infinite programming problems
• Optimality conditions and duality for nondifferentiable multiobjective semi-infinite programming problems with generalized \((C,\alpha,\rho,d)\)-convexity

This page was built for publication: Sufficiency in nonsmooth multiobjective programming involving generalized \(( F, \rho\) )-convexity

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