IDEAS home Printed from https://ideas.repec.org/a/spr/opsear/v61y2024i2d10.1007_s12597-023-00715-3.html
   My bibliography  Save this article

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

Author

Listed:
  • Kailash Lachhwani

    (National Institute of Technical Teachers Training and Research)

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.

Suggested Citation

  • Kailash Lachhwani, 2024. "An improved solution for fully neutrosophic multi-level linear programming problem based on Laplace transform," OPSEARCH, Springer;Operational Research Society of India, vol. 61(2), pages 867-896, June.
    • Handle: RePEc:spr:opsear:v:61:y:2024:i:2:d:10.1007_s12597-023-00715-3
    DOI: 10.1007/s12597-023-00715-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12597-023-00715-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s12597-023-00715-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Lachhwani, Kailash, 2015. "Modified FGP approach for multi-level multi objective linear fractional programming problems," Applied Mathematics and Computation, Elsevier, vol. 266(C), pages 1038-1049.
    2. Kailash Lachhwani, 2021. "Solving the general fully neutrosophic multi-level multiobjective linear programming problems," OPSEARCH, Springer;Operational Research Society of India, vol. 58(4), pages 1192-1216, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Lv, J. & Li, Y.P. & Huang, G.H. & Ding, Y.K. & Li, X. & Li, Y., 2022. "Planning energy economy and eco-environment nexus system under uncertainty: A copula-based stochastic multi-level programming method," Applied Energy, Elsevier, vol. 312(C).
    2. Mustapha Kaci & Sonia Radjef, 2023. "An adaptive method to solve multilevel multiobjective linear programming problems," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 33(3), pages 29-44.
    3. Kailash Lachhwani, 2021. "Solving the general fully neutrosophic multi-level multiobjective linear programming problems," OPSEARCH, Springer;Operational Research Society of India, vol. 58(4), pages 1192-1216, December.
    4. M. S. Osman & O. E. Emam & M. A. El Sayed, 2017. "Stochastic Fuzzy Multi-level Multi-objective Fractional Programming Problem: A FGP Approach," OPSEARCH, Springer;Operational Research Society of India, vol. 54(4), pages 816-840, December.
    5. M. A. El Sayed & Ibrahim A. Baky & Pitam Singh, 2020. "A modified TOPSIS approach for solving stochastic fuzzy multi-level multi-objective fractional decision making problem," OPSEARCH, Springer;Operational Research Society of India, vol. 57(4), pages 1374-1403, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:opsear:v:61:y:2024:i:2:d:10.1007_s12597-023-00715-3. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.