Nonsmooth Invexity in Multiobjective Programming

DOI10.1080/02522667.1994.10699173zbMath0826.90100OpenAlexW2093920465MaRDI QIDQ4298541

Gue Myung Lee

Publication date: 2 August 1994

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1994.10699173

zbMATH Keywords

multicriterial problemsinequalities as constraintsnecessary and sufficient Kuhn-Tucker conditionsnonsmooth invexityWolfe type duality theorems

Mathematics Subject Classification ID

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

Related Items

Duality in Vector Optimization Under Type 1 α-Invexity in Banach Spaces, Exactness of the absolute value penalty function method for nonsmooth ‐invex optimization problems, Dini and Hadamard directional derivatives in multiobjective optimization: an overview of some results, A class of \(r\)-semipreinvex functions and optimality in nonlinear programming, Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized (\(\Phi\), \(\rho\))-\(V\)-type I functions, Saddle points criteria in nondifferentiable multiobjective programming with \(V\)-invex functions via an \(\eta \)-approximation method, Vector critical points and cone efficiency in nonsmooth vector optimization, Parametric nondifferentiable multiobjective fractional programming under (b;;; )-univexity, On duality theorems for nonsmooth Lipschitz optimization problems, Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized univex functions, Optimality and duality for generalized fractional programming involving nonsmooth \((F,\rho)\)-convex functions, Optimality and duality for nonsmooth multiobjective programming problems with \(V\)-\(r\)-invexity, Saddle point criteria and Wolfe duality in nonsmooth (Φ, ρ)-invex vector optimization problems with inequality and equality constraints, Duality for a class of nonsmooth multiobjective programming problems using convexificators

Cites Work

• Unnamed Item
• Multiobjective duality with invexity
• On sufficiency of the Kuhn-Tucker conditions
• On generalized pseudoconvex functions
• Generalised convexity and symmetric duality in nonlinear programming
• Nonsmooth invexity
• Optimization and nonsmooth analysis
• What is invexity?
• On optimality conditions in nondifferentiable programming