Dual simplex method for solving fully fuzzy linear programming problems

This study proposes a novel technique for solving linear programming problems in a fully fuzzy environment. A modified version of the well-known dual simplex method is used for solving fuzzy linear programming problems. The use of a ranking function together with the Gaussian elimination process hel...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2015 4th Iranian Joint Congress on Fuzzy and Intelligent Systems (CFIS) s. 1 - 2
Hlavní autoři: Borzabadi, Akbar Hashemi, Alemy, Hossein
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.09.2015
Témata:
Computer science
Fuzzy linear programming problems (FLP)
Fuzzy simplex method
Intelligent systems
Linear programming
Mathematical programming
Matrix converters
Minimization
Ranking and selection
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This study proposes a novel technique for solving linear programming problems in a fully fuzzy environment. A modified version of the well-known dual simplex method is used for solving fuzzy linear programming problems. The use of a ranking function together with the Gaussian elimination process helps in solving linear programming problems in a fully uncertain environment. The proposed algorithm is flexible, easy and reasonable.
DOI:10.1109/CFIS.2015.7391653