On Fuzzy Primal Exterior Point Simplex Algorithm for Solving Linear Programming Problems with Fuzzy Numbers | ||||
| The International Conference on Mathematics and Engineering Physics | ||||
| Article 6, Volume 7, International Conference on Mathematics and Engineering Physics (ICMEP-7), May 2014, Page 1-13 PDF (685.37 K) | ||||
| Document Type: Original Article | ||||
| DOI: 10.21608/icmep.2014.29663 | ||||
 View on SCiNiTO | ||||
| Author | ||||
| E. M. Badr | ||||
| Scientific Computing Department, Faculty of Computers & Informatics, Benha University, Benha, Egypt. | ||||
| Abstract | ||||
| 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 first introduce a new method fuzzy exterior point simplex algorithm for solving fuzzy number linear programming problems, by use of linear ranking function. We state our recently established results and develop the fuzzy exterior point simplex algorithm. Finally, we give an illustrative example. | ||||
| Keywords | ||||
| fuzzy linear programming; ranking function; exterior point simplex algorithm | ||||
|
Statistics Article View: 160 PDF Download: 261 |
||||
