Dual Artificial Variable-Free Simplex Algorithm for Solving Neutrosophic Linear Programming Problems
This paper presents a simplified form of dual simplex algorithm for solving linear programming problems with fuzzy and neutrosophic numbers which supplies some great benefits over phase 1 of traditional dual simplex algorithm. For instance, it could start with any infeasible basis of linear programm...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of New Mexico
2021-10-01
|
| Series: | Neutrosophic Sets and Systems |
| Subjects: | |
| Online Access: | http://fs.unm.edu/NSS/DualArtificialVariable4.pdf |