Abstract
The aim of this paper is to provide new ways of dealing with dynamic programming using a context of newly proven results about fixed-point problems in linear spaces endowed with a fuzzy norm. In our paper, the general framework is set to fuzzy normed linear spaces as they are defined by Nădăban and Dzitac. When completeness is required, we will use the George and Veeramani (G-V) setup, which, for our purposes, we consider to be more suitable than Grabiec-completeness. As an important result of our work, we give an original proof for a version of Banach’s fixed-point principle on this particular setup of fuzzy normed spaces, a variant of Jungck’s fixed-point theorem in the same setup, and they are proved in G-V-complete fuzzy normed spaces, paving the way for future developments in various fields within this framework, where our application of dynamic programming makes a proper example. As the uniqueness of almost every dynamic programming problem is necessary, the fixed-point theorems represent an important tool in achieving that goal.
Subject
Physics and Astronomy (miscellaneous),General Mathematics,Chemistry (miscellaneous),Computer Science (miscellaneous)
Reference27 articles.
1. Bellman, R. (1953). An Introduction to the Theory of Dynamic Programming, The RAND Corporation. Report R-245.
2. Kamien, M.I., and Schwartz, N.L. (1991). Dynamic Optimization: The Calculus of Variations and Optimal Control in Economics and Management, Elsevier. [2nd ed.].
3. Rus, I. (1979). Principii şi Aplicaţii ale Teoriei Punctului Fix, Dacia Editing House.
4. Fixed points in fuzzy metric spaces;Fuzzy Sets Syst.,1988
5. On fixed-point theorems in fuzzy metric spaces;Fuzzy Sets Syst.,1992
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献