p ≥2 -cyclic and contractive self-mappings on a set of subsets of a metric space which are simultaneously accretive on the wholemetric space are investigated. The joint fulfilment of the p-cyclic contractiveness and accretive properties is formulated as well as potential relationships with cyclic self-mappings in order to be Kannan self-mappings. The existence and uniqueness of best proximity p...

In this paper we establish best proximity point results for monotone multivalued mappings in partially ordered metric spaces. We consider three notions of monotonicity of multvalued mappings. The main theorem is obtained by utilizing UC property and MT-functions. There is no requirment of continuity on the multivalued function which is illustrate with two supporting examples of the results esta...

We establish some common best proximity point results for generalized α−ψ-proximal contractive non-self mappings. We provide some concrete examples. We also derive some consequences on some best proximity results on a metric space endowed with a graph. 2000 Mathematics Subject Classification: 47H10, 54H25.

LetA andB be two nonempty subsets of ametric space (X, d). An element x ∈ A is said to be a fixed point of a given map T : A → B ifTx = x. Clearly,T(A)∩A ̸ = 0 is a necessary (but not sufficient) condition for the existence of a fixed point of T. If T(A) ∩ A = 0, then d(x, Tx) > 0 for all x ∈ A that is, the set of fixed points of T is empty. In a such situation, one often attempts to find an ele...

In this paper, we introduce some new classes of proximal contraction mappings and establish  best proximity point theorems for such kinds of mappings in a non-Archimedean fuzzy metric space. As consequences of these results, we deduce certain new best proximity and fixed point theorems in partially ordered non-Archimedean fuzzy metric spaces. Moreover, we present an example to illustrate the us...

In this paper, Bezier surface form is used to find the approximate solution of delay differential equations (DDE’s). By using a recurrence relation and the traditional least square minimization method, the best control points of residual function can be found where those control points determine the approximate solution of DDE. Some examples are given to show efficiency of the proposed method.

We introduce the concept of saddle points portfolio and we establish a connection between this concept and the approximate minima.

We investigate Jarńık’s points for a real function f defined in R, i.e. points x for which lim apy→x |(f(y)− f(x))/(y − x)| = +∞. In 1970, Berman has proved that the set Jf of all Jarńık’s points for a path f of the one-dimensional Brownian motion is the whole R almost surely. We give a simple explicit construction of a continuous function f with Jf = R. The main result of our paper says that f...

‎In this paper‎, ‎we present an algorithm for generating approximate nondominated points of a multiobjective optimization problem (MOP)‎, ‎where the constraints and the objective functions are convex‎. ‎We provide outer and inner approximations of nondominated points and prove that inner approximations provide a set of approximate weakly nondominated points‎. ‎The proposed algorithm can be appl...