https://ojs.luminescience.cn/DMA/issue/feed
Decision Making and Analysis
2026-01-23T10:13:52+08:00
Editorial Office of DMA
editor-dma@luminescience-press.com
Open Journal Systems
<p><em>Decision Making and Analysis</em> (DMA) is an international peer-reviewed journal and publishes research articles, reviews, case reports and conceptual papers that present theoretical, practical, statistical and modeling techniques and methods for scientific analysis so as to make informed and optimal decision. As an interdisciplinary journal, DMA welcomes manuscripts related to economics, machine learning, clinical and healthcare decision, statistical decision theory, operations research, forecasting, behavioral decision theory and cognitive psychology.</p>
https://ojs.luminescience.cn/DMA/article/view/522
Binary extended theta operation of binary soft sets
2026-01-23T10:13:52+08:00
Aslıhan Sezgin
aslihan-sezgin@gmail.com
Orhan Karamustafaoğlu
orhan.karamustafaoglu@amasya.edu.tr
<p>Binary soft set theory, first introduced by Açıkgöz and Taş in 2016, has become widely accepted as a technique for addressing and modeling uncertainty. Numerous theoretical and practical problems have been solved using this approach. Scholars have shown sustained interest in the theory's core concepts and operations since its inception. In this study, we propose the binary extended theta operation, a special binary soft set operation, and provide a thorough analysis of its basic algebraic features. We also study the distribution of this operation over certain types of binary soft set operations. By considering its algebraic properties and distribution rules, we show that, when combined with specific binary soft set operations, the binary extended theta operation forms many important algebraic structures within the collection of binary soft sets over the universe under certain conditions. The fundamental conceptual difference between the proposed binary extended theta operation and existing binary extended operations in the literature is that unlike approaches based on positive information aggregation, the theta operation systematically extracts negative information through common parameters and offers a unique and complementary tool, particularly for decision problems requiring reliable elimination, risk exclusion, and error detection. Further applications, including cryptology and decision-making, rely on operations of binary soft sets, making this theoretical subject essential from both theoretical and practical perspectives.</p>
2026-04-27T00:00:00+08:00
Copyright © 2026 Aslıhan Sezgin, Orhan Karamustafaoğlu
https://ojs.luminescience.cn/DMA/article/view/477
Novel Russell's approximation method for transportation problem under hesitant bifuzzy environment
2025-11-05T11:23:36+08:00
Ismat Beg
ibeg@lahoreschool.edu.pk
Soniya Gupta
soniyagupta1014@gmail.com
Arpa Ghosh
arpa2016ghosh@gmail.com
Dheeraj Kumar Joshi
maths.dj44010@gmail.com
<p>Transportation problem is one of the significant linear programming problems that emerges in several conditions and gains attention of many researchers. Reducing a commodity's transportation expense to meet demand at destination is the goal of the transportation problem. However, uncertainty plays a vital role in real life, making it challenging for decision-makers to provide precise values for the coefficients related to the transportation problem. Hesitant bifuzzy sets are a notable advancement of fuzzy set theory, as they allow decision-makers to deal with every hesitancy without any restriction. This study aims to introduce a formulation of transportation problem under a hesitant bifuzzy environment. In this study, we have introduced a novel Russel approximation method (RAM) for the hesitant bifuzzy transportation problem, where every parameter is represented by hesitant bifuzzy elements. To show the applicability of the proposed method, a real-life illustration has been taken in this article. Additionally, to demonstrate the superiority of the proposed method, a comparative study has also been conducted with other existing methods, which results in the minimum transportation cost.</p>
2025-12-30T00:00:00+08:00
Copyright © 2025 Ismat Beg, Soniya Gupta, Arpa Ghosh, Dheeraj Kumar Joshi