‎in this paper‎, ‎we introduce and study a class of generalized vector quasi-equilibrium problem‎, ‎which includes many vector equilibrium problems‎, ‎equilibrium problems‎, ‎vector variational inequalities and variational inequalities as special cases‎. ‎using one person game theorems‎, ‎the concept of escaping sequences and without convexity assumptions‎, ‎we prove some existence results for ...

we establish a relationship between general constrained pseudoconvex optimization problems and globally projected dynamical systems. a corresponding novel neural network model, which is globally convergent and stable in the sense of lyapunov, is proposed. both theoretical and numerical approaches are considered. numerical simulations for three constrained nonlinear optimization problems are giv...

In this paper we will prove certain Hadamard and Fejer-Hadamard inequalities for the functions whose nth derivatives are convex by using Caputo k-fractional derivatives. These results have some relationship with inequalities for Caputo fractional derivatives.

In a celebrated work by Shao [13] several inequalities for negatively associated random variables were proved. In this paper we obtain some maximal inequalities for associated random variables. Also we establish a maximal inequality for demimartingales which generalizes and improves the result of Christofides [4].

in the maximum flow network interdiction problem, an attacker attempts to minimize the maximum flow by interdicting flow on the arcs of network. in this paper, our focus is on the nodal interdiction for network instead of the arc interdiction. two path inequalities for the node-only interdiction problem are represented. it has been proved that the integrality gap of relaxation of the maximum fl...

in this paper‎, ‎making use of a new identity‎, ‎we establish new‎ ‎inequalities of ostrowski type for the class of preinvex functions and‎ ‎gave some midpoint type inequalities‎.

In this paper, the concepts of well-posednesses and Hadamard well-posedness for a family of mixed variational inequalities are studied. Also, some metric characterizations of them are presented and some relations between well-posedness and Hadamard well-posedness of a family of mixed variational inequalities is studied. Finally, a relation between well-posedness for the family of mixed variatio...

We present a method of lifting linear inequalities for the flag f -vector of polytopes to higher dimensions. Known inequalities that can be lifted using this technique are the non-negativity of the toric g-vector and that the simplex minimizes the cd-index. We obtain new inequalities for 6-dimensional polytopes. In the last section we present the currently best known inequalities for dimensions...

This paper studies the complexity of solving two classes of non-cooperative games in a distributed manner in which the players communicate with a set of system nodes over noisy communication channels. The complexity of solving each game class is defined as the minimum number of iterations required to find a Nash equilibrium (NE) of any game in that class with ǫ accuracy. First, we consider the ...