In this paper, the concept of pseudoconvexity and quasiconvexity for continuous~-time functions are studied and an equivalence condition for pseudoconvexity is obtained. Moreover, under pseudoconvexity assumptions, some relationships between Minty and Stampacchia vector variational inequalities and continuous-time programming problems are presented. Finally, some characterizations of the soluti...

in the present paper, we introduce and study a fuzzy vector equilibrium problem and prove some existence results with and without convexity assumptions by using some particular forms of results of textit{kim} and textit{lee} [w.k. kim and k.h. lee, generalized fuzzy games and fuzzy equilibria, fuzzy sets and systems, 122 (2001), 293-301] and textit{tarafdar} [e. tarafdar, fixed point theorems i...

In this paper, we prove the equivalence among the Minty vector variational-like inequality, Stampacchia vector variational-like inequality, and a nondifferentiable and nonconvex vector optimization problem. By using a fixed-point theorem, we establish also an existence theorem for generalized weakly efficient solutions to the vector optimization problem for nondifferentiable and nonconvex funct...

By introducing redundant Klee-Minty examples, we have previously shown that the central path can be bent along the edges of the Klee-Minty cubes, thus having 2n − 2 sharp turns in dimension n. In those constructions the redundant hyperplanes were placed parallel with the facets active at the optimal solution. In this paper we present a simpler and more powerful construction, where the redundant...

In the present paper, we introduce and study a fuzzy vector equilibrium problem and prove some existence results with and without convexity assumptions by using some particular forms of results of textit{Kim} and textit{Lee} [W.K. Kim and K.H. Lee, Generalized fuzzy games and fuzzy equilibria, Fuzzy Sets and Systems, 122 (2001), 293-301] and textit{Tarafdar} [E. Tarafdar, Fixed point theorems i...

The connections between variational inequalities and optimization problems is well known, and many investigators have discussed them along many years; see, for instance, [1, 8, 10, 13]. This last article, which was authored by Giannessi, in particular, is one of the main works that study these connections in the finite-dimensional context. In recent years, the interest in the investigation on t...

we prove a strong convergence result for a sequence generated by halpern's type iteration for approximating a common fixed point of a countable family of quasi-lipschitzian mappings in a real hilbert space. consequently, we apply our results to the problem of finding a common fixed point of asymptotically nonexpansive mappings, an equilibrium problem, and a variational inequality problem for co...

In the early 1970s, by work of Klee and Minty (1972) and Zadeh (1973), the Simplex Method, the Network Simplex Method, and the Successive Shortest Path Algorithm have been proved guilty of exponential worst-case behavior (for certain pivot rules). Since then, the common perception is that these algorithms can be fooled into investing senseless effort by ‘bad instances’ such as, e. g., Klee-Mint...

The analysis of the connections among generalized systems, Vector Optimization Problems and Variational Inequalities allows to deepen the study of the properties of the Minty Vector Variational Inequality. In particular, under suitable regularity assumptions,the equivalence between Minty Vector Variational Inequality and Stampacchia Vector Variational Inequality is shown.

Finding augmenting chains is in the heart of the maximum matching problem, which is equivalent to the maximum stable set problem in the class of line graphs. Due to the celebrated result of Edmonds, augmenting chains can be found in line graphs in polynomial time. Minty and Sbihi generalized this result to claw-free graphs. In this paper we extend it to larger classes. As a particular consequen...