Abstract
Linear programming problems with fuzzy variables have been investigated by many researchers in the recent literature. Some methods to solve these problems, such as the primal simplex method and the dual simplex method, are based on the concept of comparison of fuzzy numbers by using ranking functions. In this paper, we give a new primal-dual algorithm for solving linear programming problems with fuzzy variables by using duality results, which was proposed by Mahdavi-Amiri and Nasseri (2007). This algorithm will be useful for sensitivity analysis when the activity vectors change for basic columns.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
