An Intelligent Dual Simplex Method to Solve Triangular Neutrosophic Linear Fractional Programming Problem
This paper develops a general form of neutrosophic linear fractional programming (NLFP) problem and proposed a novel model to solve it. In this method the NLFP problem is decomposed into two neutrosophic linear programming (NLP) problem. Furthermore, the problem has been solved by combination of dua...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of New Mexico
2020-09-01
|
| Series: | Neutrosophic Sets and Systems |
| Subjects: | |
| Online Access: | https://fs.unm.edu/NSS/AnIntelligentDualSimplex5.pdf |
| _version_ | 1797769125778423808 |
|---|---|
| author | Sapan Kumar Das S.A. Edalatpanah Jatindra Kumar Dash |
| author_facet | Sapan Kumar Das S.A. Edalatpanah Jatindra Kumar Dash |
| author_sort | Sapan Kumar Das |
| collection | DOAJ |
| description | This paper develops a general form of neutrosophic linear fractional programming (NLFP) problem and proposed a novel model to solve it. In this method the NLFP problem is decomposed into two neutrosophic linear programming (NLP) problem. Furthermore, the problem has been solved by combination of dual simplex method and a special ranking function. In addition, the model is compared with an existing method. An illustrative example is shown for better understanding of the proposed method. The results show that the method is computationally very simple and comprehensible. |
| first_indexed | 2024-03-12T21:04:24Z |
| format | Article |
| id | doaj.art-cc63351d80774b49bf8b4880d6192830 |
| institution | Directory Open Access Journal |
| issn | 2331-6055 2331-608X |
| language | English |
| last_indexed | 2024-03-12T21:04:24Z |
| publishDate | 2020-09-01 |
| publisher | University of New Mexico |
| record_format | Article |
| series | Neutrosophic Sets and Systems |
| spelling | doaj.art-cc63351d80774b49bf8b4880d61928302023-07-30T17:29:45ZengUniversity of New MexicoNeutrosophic Sets and Systems2331-60552331-608X2020-09-0136506910.5281/zenodo.4065379An Intelligent Dual Simplex Method to Solve Triangular Neutrosophic Linear Fractional Programming ProblemSapan Kumar DasS.A. EdalatpanahJatindra Kumar DashThis paper develops a general form of neutrosophic linear fractional programming (NLFP) problem and proposed a novel model to solve it. In this method the NLFP problem is decomposed into two neutrosophic linear programming (NLP) problem. Furthermore, the problem has been solved by combination of dual simplex method and a special ranking function. In addition, the model is compared with an existing method. An illustrative example is shown for better understanding of the proposed method. The results show that the method is computationally very simple and comprehensible.https://fs.unm.edu/NSS/AnIntelligentDualSimplex5.pdftriangular neutrosophic numbersdual simplex methodranking functionlinear fractional programminglinear programming |
| spellingShingle | Sapan Kumar Das S.A. Edalatpanah Jatindra Kumar Dash An Intelligent Dual Simplex Method to Solve Triangular Neutrosophic Linear Fractional Programming Problem Neutrosophic Sets and Systems triangular neutrosophic numbers dual simplex method ranking function linear fractional programming linear programming |
| title | An Intelligent Dual Simplex Method to Solve Triangular Neutrosophic Linear Fractional Programming Problem |
| title_full | An Intelligent Dual Simplex Method to Solve Triangular Neutrosophic Linear Fractional Programming Problem |
| title_fullStr | An Intelligent Dual Simplex Method to Solve Triangular Neutrosophic Linear Fractional Programming Problem |
| title_full_unstemmed | An Intelligent Dual Simplex Method to Solve Triangular Neutrosophic Linear Fractional Programming Problem |
| title_short | An Intelligent Dual Simplex Method to Solve Triangular Neutrosophic Linear Fractional Programming Problem |
| title_sort | intelligent dual simplex method to solve triangular neutrosophic linear fractional programming problem |
| topic | triangular neutrosophic numbers dual simplex method ranking function linear fractional programming linear programming |
| url | https://fs.unm.edu/NSS/AnIntelligentDualSimplex5.pdf |
| work_keys_str_mv | AT sapankumardas anintelligentdualsimplexmethodtosolvetriangularneutrosophiclinearfractionalprogrammingproblem AT saedalatpanah anintelligentdualsimplexmethodtosolvetriangularneutrosophiclinearfractionalprogrammingproblem AT jatindrakumardash anintelligentdualsimplexmethodtosolvetriangularneutrosophiclinearfractionalprogrammingproblem AT sapankumardas intelligentdualsimplexmethodtosolvetriangularneutrosophiclinearfractionalprogrammingproblem AT saedalatpanah intelligentdualsimplexmethodtosolvetriangularneutrosophiclinearfractionalprogrammingproblem AT jatindrakumardash intelligentdualsimplexmethodtosolvetriangularneutrosophiclinearfractionalprogrammingproblem |