• 호남수학학술지
• /
• 제41권2호
• /
• pp.435-447
• /
• 2019

The notions of a neutrosophic subalgebra and a neutrosohic ideal of a subtraction algebra are introduced. Characterizations of a neutrosophic subalgebra and a neutrosophic ideal are investigated. We show that the homomorphic preimage of a neutrosophic subalgebra of a subtraction algebra is a neutrosophic subalgebra, and the onto homomorphic image of a neutrosophic subalgebra of a subtraction algebra is a neutrosophic subalgebra.

• 호남수학학술지
• /
• 제44권2호
• /
• pp.209-218
• /
• 2022

The notion of positive implicative MBJ-neutosophic ideal of BCK-algebras is defined and some properties of it are investigated. Relations between positive implicative MBJ-neutrosophic ideal and positive implicative ideal are discussed. In a BCK-algebra, the extension property for positive implicative MBJ-neutrosophic ideal is established.

• Korean Journal of Mathematics
• /
• 제32권1호
• /
• pp.121-135
• /
• 2024

In this paper, we have presented rough ideal statistical convergence of sequence on neutrosophic normed spaces as a significant convergence criterion. As neutrosophication can handle partially dependent components, partially independent components and even independent components involved in real-world problems. By examining some properties related to rough ideal convergence in these spaces we have established some equivalent conditions on the set of ideal statistical limit points for rough ideal statistically convergent sequences.

• Journal of applied mathematics & informatics
• /
• 제42권4호
• /
• pp.831-854
• /
• 2024

The transportation problem (TP) is one of the earliest and the most significant implementations of linear programming problem (LPP). It is a specific type of LPP that mostly works with logistics and it is connected to day-to-day activities in our everyday lives. Nowadays decision makers (DM's) aim to reduce the transporting expenses and simultaneously aim to reduce the transporting time of the distribution system so the bi-objective transportation problem (BOTP) is established in the research. In real life, the transportation parameters are naturally uncertain due to insufficient data, poor judgement and circumstances in the environment, etc. In view of this, neutrosophic bi-objective transportation problem (NBOTP) is introduced in this paper. By introducing single-valued trapezoidal neutrosophic numbers (SVTrNNs) to the co-efficient of the objective function, supply and demand constraints, the problem is formulated. The DM's aim is to determine the optimal compromise solution for NBOTP. The extended weighted possibility mean for single-valued trapezoidal neutrosophic numbers based on [40] is proposed to transform the single-valued trapezoidal neutrosophic BOTP (SVTrNBOTP) into its deterministic BOTP. The transformed deterministic BOTP is then solved using the dripping method [10]. Numerical examples are provided to illustrate the applicability, effectiveness and usefulness of the solution approach. A sensitivity analysis (SA) determines the sensitivity ranges for the objective functions of deterministic BOTP. Finally, the obtained optimal compromise solution from the proposed approach provides a better result as compared to the existing approaches and conclusions are discussed for future research.