∊-Variational inequalities in partially ordered spaces

DOI10.1080/02331939608844170zbMath0869.90061MaRDI QIDQ4893703

Christiane Tammer, E.-Ch. Henkel

Publication date: 18 September 1996

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

vector optimization; approximation problems; vector variational principle; partially ordered linear topological space; approximately efficient elements

Mathematics Subject Classification ID

90C29: Multi-objective and goal programming

49J40: Variational inequalities

90C48: Programming in abstract spaces

Related Items

OPTIMALITY CONDITIONS AND APPROXIMATE OPTIMALITY CONDITIONS IN LOCALLY LIPSCHITZ VECTOR OPTIMIZATION, Well posedness in vector optimization problems and vector variational inequalities, Duality in \(\varepsilon \)-variational inequality problems, εVariational inequalities for vector approximation problems, Well-posed vector optimization problems and vector variational inequalities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonconvex separation theorems and some applications in vector optimization
• On Pareto optima, the Fermat-Weber problem, and polyhedral gauges
• \(\epsilon\)-solutions in vector minimization problems
• Geometrical properties of the Fermat-Weber problem
• On two generalizations of Pareto minimality
• Kolmogorov-conditions for vectorial approximation problems
• On several concepts for \(\varepsilon\)-efficiency
• Approximation of solutions for location problems
• On the variational principle
• A vector variational inequality and optimization over an efficient set
• Continuity and Differentiability Properties of Convex Operators
• Duality for Multiple Objective Convex Programs
• Vector variational inequality and its duality
• A generalization of ekellandz’s variational principle
• A nonconvex vector minimization problem
• A note on Fermat's problem