首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
The purpose of this article is to resolve the non-linear programming problem of globally minimizing the real valued function ${x \longrightarrow d(x, Sx)}$ where S is a non-self-mapping in the setting of a metric space with the distance function ‘d’. An iterative algorithm is also furnished to find a solution of such global optimization problems. As a consequence, one can determine an optimal approximate solution to some equations of the form Sx = x.  相似文献   

2.
S. Sadiq Basha 《TOP》2014,22(2):543-553
This paper addresses the non-linear programming problem of globally minimizing the real valued function x?d(x,Sx) where S is a generalized proximal contraction in the setting of a metric space. Eventually, one can obtain optimal approximate solutions to some fixed-point equations in the event that they have no solution.  相似文献   

3.
Let us assume that A and B are non-empty subsets of a metric space. In view of the fact that a non-self mapping T:A?B does not necessarily have a fixed point, it is of considerable significance to explore the existence of an element x that is as close to Tx as possible. In other words, when the fixed point equation Tx=x has no solution, then it is attempted to determine an approximate solution x such that the error d(x,Tx) is minimum. Indeed, best proximity point theorems investigate the existence of such optimal approximate solutions, known as best proximity points, of the fixed point equation Tx=x when there is no solution. Because d(x,Tx) is at least d(A,B), a best proximity point theorem ascertains an absolute minimum of the error d(x,Tx) by stipulating an approximate solution x of the fixed point equation Tx=x to satisfy the condition that d(x,Tx)=d(A,B). This article establishes best proximity point theorems for proximal contractions, thereby extending Banach’s contraction principle to the case of non-self mappings.  相似文献   

4.
This article is concerned with some new best proximity point theorems for principal cyclic contractive mappings, proximal cyclic contractive mappings, and proximal contractive mappings. As a consequence, an interesting fixed point theorem, due to Edelstein, for a contractive mapping is obtained from all those best proximity point theorems.  相似文献   

5.
The primary objective of this article is to elicit some interesting extensions of the simple but powerful Banach’s contraction principle to the case of non-self-mappings. In fact, due to the fact that best proximity point theorems fit the bill to this end, the proposed extensions are presented as best proximity point theorems for non-self proximal contractions which are more general than the notion of self-contractions.  相似文献   

6.
The main purpose of this article is to address a problem that amalgamates approximation and optimization in the setting of a partially ordered set that is endowed with a metric. Indeed, if A and B are non-void subsets of a partially ordered set that is equipped with a metric, and S is a non-self mapping from A to B, this paper scrutinizes the existence of an optimal approximate solution, called a best proximity point of the mapping S, to the operator equation Sx = x where S is a continuous, proximally monotone, ordered proximal contraction. Further, this paper manifests an iterative algorithm for discovering such an optimal approximate solution. As a special case of the result obtained in this article, an interesting fixed point theorem on partially ordered sets is deduced.  相似文献   

7.
In this paper, we introduce a new class of maps, called cyclic strongly quasi-contractions, which contains the cyclic contractions as a subclass. Then we give some convergence and existence results of best proximity point theorems for cyclic strongly quasi-contraction maps. An example is given to support our main results.  相似文献   

8.
We study the existence of best proximity points for single-valued non-self mappings. Also, we prove a best proximity point theorem for set-valued non-self mappings in metric spaces with an appropriate geometric property. Examples are given to support the usability of our results.  相似文献   

9.
We introduce a notion of cyclic orbital Meir-Keeler contraction and give sufficient conditions for the existence of fixed points and best proximity points of such a map. Our main result is a generalization of a best proximity point result due to Di Bari et al. [C. Di Bari, T. Suzuki, C. Vetro, Best proximity points for cyclic Meir-Keeler contractions, Nonlinear Anal. 69 (2008) 3790-3794].  相似文献   

10.
Let us contemplate the problem of solving the linear or non-linear equations of the form \(Tx=gx\) in the framework of metric space. When T is a non-self mapping and g is a self-mapping, it may cause the non-existence of a solution to the preceding equation. At this juncture, one is of course interested in computing an approximate solution \(x^*\) in the space such that \(Tx^*\) is as close to \(gx^*\) as possible. To be precise, if T is from A to B and g is from A to A, where A and B are subsets of a metric space, one is concerned with the computation of a global minimizer of the mapping \(x\longrightarrow d(gx, Tx)\) which serves as a measure of closeness between Tx and gx. This paper is concerned with the resolution of the aforesaid global minimization problem if T is a proximal contraction and g is an isometry in the frameworks of fairly and proximally complete spaces.  相似文献   

11.
We consider the problem of finding a best proximity point which achieves the minimum distance between two nonempty sets in a non-Archimedean fuzzy metric space. First we prove the existence and uniqueness of the best proximity point by using different contractive conditions, then we present some examples to support our best proximity point theorems.  相似文献   

12.
Let us deliberate the question of computing a solution to the problems that can be articulated as the simultaneous equations \({Sx = x}\) and \({Tx = x}\) in the framework of metric spaces. However, when the mappings in context are not necessarily self-mappings, then it may be consequential that the equations do not have a common solution. At this juncture, one contemplates to compute a common approximate solution of such a system with the least possible error. Indeed, for a common approximate solution \({x^*}\) of the equations, the real numbers \({d(x^*, Sx^*)}\) and \({d(x^*,Tx^*)}\) measure the errors due to approximation. Eventually, it is imperative that one pulls off the global minimization of the multiobjective functions \({x \rightarrow d(x, Sx)}\) and \({x \rightarrow d(x, Tx)}\). When S and T are mappings from A to B, it follows that \({d(x, Sx) \geq d(A, B)}\) and \({d(x, Tx) \geq d(A, B)}\) for every \({x \in A}\). As a result, the global minimum of the aforesaid problem shall be actualized if it is ascertained that the functions \({x \rightarrow d(x, Sx)}\) and \({x \rightarrow d(x, Tx)}\) attain the lowest possible value d(A, B). The target of this paper is to resolve the preceding multiobjective global minimization problem when S is a T-cyclic contraction or a generalized cyclic contraction, thereby enabling one to determine a common optimal approximate solution to the aforesaid simultaneous equations.  相似文献   

13.
Summary In this paper the well-knownLegendre transform-type of non-linear duality is extended to the general vector maximum problem. Duality is studied in terms of the primal and dual objective sets rather than in terms of the underlying feasible solutions. The structure of the objective sets is fully explored. The main result in duality is that under reasonable regularity assumptions there are no duality gaps between the primal and dual objective sets.
Zusammenfassung In dieser Arbeit wird das bekannte, derLegendre-Transformation nachgebildete Konzept der nichtlinearen Dualität auf das allgemeine Vektor-Maximum-Problem übertragen. Hierbei wird die Dualität der Zielmengen (nicht aber der zulässigen Lösungen) des primalen und dualen Programms untersucht. Die Struktur der Zielmengen wird eingehend studiert. Hauptergebnis ist, daß unter plausiblen Regularitätsbedingungen keine Lücken zwischen der primalen und der dualen Zielmenge auftreten.


This paper was originally written when the author was at the Center for Operations Research and Econometrics, University of Louvain. I wish to thank ProfessorsG. de Ghellinck, J. Drèze, of Louvain, andW. Szwarc, of Wrocaw, for stimulating discussions of the subject. I alone am responsible for all remaining errors.

Vorgel. v.:W. Wittmann  相似文献   

14.
The objective of this article is to establish the existence of critical points for functionals of classC 2defined on real Hilbert spaces. The argument is based on the infinite dimensional Morse theory introduced by Gromoll-Meyer [13]. The abstract results are applied to study the existence of nonzero solutions for a class of semilinear elliptic problems where the nonlinearity possesses a superlinear growth on a direction of the real line.This research was partially supported by CNPq/Brazil  相似文献   

15.
Demand and supply pattern for most products varies during their life cycle in the markets. In this paper, the author presents a transportation problem with non-linear constraints in which supply and demand are symmetric trapezoidal fuzzy value. In order to reflect a more realistic pattern, the unit of transportation cost is assumed to be stochastic. Then, the non-linear constraints are linearized by adding auxiliary constraints. Finally, the optimal solution of the problem is found by solving the linear programming problem with fuzzy and crisp constraints and by applying fuzzy programming technique. A new method proposed to solve this problem, and is illustrated through numerical examples. Multi-objective goal programming methodology is applied to solve this problem. The results of this research were developed and used as one of the Decision Support System models in the Logistics Department of Kayson Co.  相似文献   

16.
A best proximity point theorem explores the existence of an optimal approximate solution, known as a best proximity point, to the equations of the form Tx = x where T is a non-self mapping. The purpose of this article is to establish some best proximity point theorems for non-self non-expansive mappings, non-self Kannan- type mappings and non-self Chatterjea-type mappings, thereby producing optimal approximate solutions to some fixed point equations. Also, algorithms for determining such optimal approximate solutions are furnished in some cases.  相似文献   

17.
18.
We tackle precedence-constrained sequencing on a single machine in order to minimize total weighted tardiness. Classic dynamic programming (DP) methods for this problem are limited in performance due to excessive memory requirements, particularly when the precedence network is not sufficiently dense. Over the last decades, a number of precedence theorems have been proposed, which distinguish dominant precedence constraints for a job pool that is initially without precedence relation. In this paper, we connect and extend the findings of the foregoing two strands of literature. We develop a framework for applying the precedence theorems to the precedence-constrained problem to tighten the search space, and we propose an exact DP algorithm that utilizes a new efficient memory management technique. Our procedure outperforms the state-of-the-art algorithm for instances with medium to high network density. We also empirically verify the computational gain of using different sets of precedence theorems.  相似文献   

19.
20.
This paper gives a proof of convergence of an iterative method for maximizing a concave function subject to inequality constraints involving convex functions. The linear programming problem is an important special case. The primary feature is that each iteration is very simple computationally, involving only one of the constraints. Although the paper is theoretical in nature, some numerical results are included.The author wishes to express his gratitude to Ms. A. Dunham, who provided a great deal of assistance in carrying out the computations presented in this paper.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号