Application of continuous-time programming problems to a class of variational-type inequalities

DOI10.1016/j.mcm.2007.07.004zbMath1145.90444OpenAlexW2004083085MaRDI QIDQ949502

B. E. Eshmatov

Publication date: 21 October 2008

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mcm.2007.07.004

zbMATH Keywords

efficiencydualitymultiobjective problem\(\rho - (\eta, \theta )\)-invexityproperly efficient

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Programming in abstract spaces (90C48) Optimality conditions for problems in abstract spaces (49K27)

Cites Work

• Unnamed Item
• Unnamed Item
• Optimality conditions and duality for a class of continuous-time programming problems with nonlinear operator equality and inequality constraints
• Optimality criteria in nonlinear programming involving nonconvex functions
• The essence of invexity
• On sufficiency of the Kuhn-Tucker conditions
• Minmax and duality in nonlinear programming
• Duality in nonlinear programming and the minimax theorem
• Strictly quasi-convex (concave) functions and duality in mathematical programming
• Generalized sufficiency criteria in continuous-time programming with application to a class of variational-type inequalities
• Optimization and second-order derivatives for a Lipschitz function
• Duality with generalized convexity
• Necessary and sufficient conditions in constrained optimization
• Invex functions and constrained local minima
• Further Generalizations of Convexity in Mathematical Programming

This page was built for publication: Application of continuous-time programming problems to a class of variational-type inequalities