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

DOI10.1016/J.MCM.2007.07.004MaRDI QIDQ949502zbMATH OpenOpenAlexFDO

Authors 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

\(\rho - (\eta, \theta )\)-invexitydualityefficiencymultiobjective problemproperly efficient

Mathematics Subject Classification ID

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

Recommendations

• Generalized sufficiency criteria in continuous-time programming with application to a class of variational-type inequalities
• Carathéodory-John--type sufficiency criteria in continuous-time nonlinear programming under generalized (,)-(,)-type I invexity
• Relations between vector continuous-time program and vector variational-type inequality
• Optimality in continuous-time multiobjective optimization and vector variational-like inequalities
• Optimality and duality for variational problems with generalized convexity

Cites work

• Duality in nonlinear programming and the minimax theorem
• Duality with generalized convexity
• Further Generalizations of Convexity in Mathematical Programming
• Generalized sufficiency criteria in continuous-time programming with application to a class of variational-type inequalities
• scientific article; zbMATH DE number 3902413 (Why is no real title available?)
• scientific article; zbMATH DE number 3323651 (Why is no real title available?)
• Invex functions and constrained local minima
• Minmax and duality in nonlinear programming
• Necessary and sufficient conditions in constrained optimization
• On sufficiency of the Kuhn-Tucker conditions
• 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
• Optimization and second-order derivatives for a Lipschitz function
• Strictly quasi-convex (concave) functions and duality in mathematical programming
• The essence of invexity

Cited in

(5)

• On the form of solutions to the linear continuous time programming problem and a conjecture by Tyndall
• Relations between vector continuous-time program and vector variational-type inequality
• Generalized sufficiency criteria in continuous-time programming with application to a class of variational-type inequalities
• The continuous-time problem with interval-valued functions: applications to economic equilibrium
• Carathéodory-John--type sufficiency criteria in continuous-time nonlinear programming under generalized (,)-(,)-type I invexity

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

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