A Study of Boundedness in Fuzzy Normed Linear Spaces

In the present paper some different types of boundedness in fuzzy normed linear spaces of type ( X , N , ∗ ) , where ∗ is an arbitrary t-norm, are considered. These boundedness concepts are very general and some of them have no correspondent in the classical topological metrizable linear spaces. Properties of such bounded sets are given and we make a comparative study among these types of boundedness. Among them there are various concepts concerning symmetrical properties of the studied objects arisen from the classical setting appropriate for this journal topics. We establish the implications between them and illustrate by examples that these concepts are not similar

Fixed-Point Theorems in Fuzzy Normed Linear Spaces for Contractive Mappings with Applications to Dynamic-Programming

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

Fixed-Point Theorems in Fuzzy Normed Linear Spaces for Contractive Mappings with Applications to Dynamic-Programming

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