An improved solution for fully neutrosophic multi-level linear programming problem based on Laplace transform

Kailash Lachhwani ()
Additional contact information
Kailash Lachhwani: National Institute of Technical Teachers Training and Research

OPSEARCH, 2024, vol. 61, issue 2, No 15, 867-896

Abstract: Abstract The main objective of this paper is to present an improved solution approach for a fully neutrosophic generalized multi-level linear programming (MLP) problem in which de-neutrosophication of coefficients and parameters are carried out with the proportional probability density functions of each N Number and the use of Laplace transform. The present paper describes a unique solution methodology for generalized multi-level linear programming involving coefficient parameters in objectives at each level as well as constraints as interval-valued trapezoidal neutrosophic numbers (IVTrpN numbers), based on Laplace Transform. In this approach, we first propose to associate the probability density function to each membership function of each IVTrpN number and obtain an equivalent output value of each N Number using Laplace transform. The proposed algorithm is novel and unique for solving the generalized MLLP problem under N Numbers environment, which converts the neutrosophic problem into an equivalent crisp problem. After that, the multi-level structure of the crisp problem is tackled by formulating separate membership functions for each objective function at each level and decision variables up to the (T-1) level with their best values. A simple solution model is formulated to obtain a satisfactory solution to MLLP problem under the neutrosophic environment with the help of usual goal programming. Further, a comparative study is also carried out between the use of Laplace transform and Melin transform (as suggested by Tamilarasi and Paulraj (SC 26:8497–8507, 2022)) for de-neutrosophication of N numbers in the context of the present problem. Numerical example and complex real problem are illustrated to show the functionality and applicability of the proposed improved approach.

Keywords: Multi-level linear programming (MLLP) problem; Interval valued trapezoidal neutrosophic number (IVTrpNN); Probability density function; Laplace transform; Satisfactory solution (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s12597-023-00715-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:opsear:v:61:y:2024:i:2:d:10.1007_s12597-023-00715-3

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/12597

DOI: 10.1007/s12597-023-00715-3

Access Statistics for this article

OPSEARCH is currently edited by Birendra Mandal

More articles in OPSEARCH from Springer, Operational Research Society of India
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().