a new class of nonlinear set-valued variationalinclusions involving $(a,eta)$-monotone mappings in a banachspace setting is introduced, and then based on the generalizedresolvent operator technique associated with$(a,eta)$-monotonicity, the existence and approximationsolvability of solutions using an iterative algorithm and fixedpint theory is investigated.

we propose to use a mathematical method based on stochastic comparisons of markov chains in order to derive performance indice bounds‎. ‎the main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (fcfs) orbit and general retrial times using the stochastic ordering techniques‎.

This article studies the monotonicity behavior of plural determiners that quantify over collections. Following previous work, we describe the collective interpretation of determiners such as all, some and most using generalized quantifiers of a higher type that are obtained systematically by applying a type shifting operator to the standard meanings of determiners in Generalized Quantifier Theo...

In this paper, by using a new concept of strong convexity, we obtain sufficient conditions for Holder continuity of the solution mapping for a parametric weak vector equilibrium problem in the case where the solution mapping is a general set-valued one. Without strong monotonicity assumptions, the Holder continuity for solution maps to parametric weak vector optimization problems is discussed.

A new class of nonlinear set-valued variationalinclusions involving $(A,eta)$-monotone mappings in a Banachspace setting is introduced, and then based on the generalizedresolvent operator technique associated with$(A,eta)$-monotonicity, the existence and approximationsolvability of solutions using an iterative algorithm and fixedpint theory is investigated.

Variational inequalities theory has been widely used in many fields, such as economics, physics, engineering, optimization and control, transportation [1, 4]. Like convexity to mathematical programming problem (MP), monotonicity plays an important role in solving variational inequality (VI). To investigate the variational inequality, many kinds of monotone mappings have been introduced in the l...

and Applied Analysis 3 Example 8. LetX = Z = R, Y = R, and E = F = [0, +∞) ⊂ X and let G,C : E → 2, e : E → Y define as G (u) = {(U, V) : U − u ≤ V ≤ u − U, 0 ≤ U ≤ u} , ∀u ∈ F, C (x) = {(U, V) : 0 ≤ V ≤ ( 3 2 + x)U,U ≥ 0} , ∀x ∈ E, e (x) = (1, 1) , ∀x ∈ E, (7) respectively. We can see that ξ G (x, u) = (1 + (2/(1 + 2x)))u. Definition 9. LetD ⊂ Y be a cone,H : F → 2, and ς : F → R. ς is calledm...

The structural complexity of instances of computational problems has been an important research area in theoretical computer science in the last decades. Its success manifested itself in tree-width—a complexity measure for undirected graphs. Many practically relevant problems that are difficult in general, can be efficiently solved on graphs of bounded tree-width. For directed graphs, there are...

An efficient method for scalar advection is developed that selectively preserves monotonicity. Monotonicity preservation is applied only where the scalar field is likely to contain discontinuities as indicated by significant grid-cell-to-grid-cell variations in a smoothness measure conceptually similar to that used in weighted essentially non-oscillatory (WENO) methods. In smooth regions, the n...

Monotonicity of functions has been successfully used in many problems of interval computations. However, in the context of interval computations, monotonicity seems somewhat ad hoc. In this paper, we show that monotonicity can be reformulated in interval terms and is, therefore, a natural condition for interval mathematics. One of the main problems of interval computations it to compute the ran...