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...

Full description

Bibliographic Details

Published in:	2015 4th Iranian Joint Congress on Fuzzy and Intelligent Systems (CFIS) pp. 1 - 2
Main Authors:	Borzabadi, Akbar Hashemi, Alemy, Hossein
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.09.2015
Subjects:	Computer science Fuzzy linear programming problems (FLP) Fuzzy simplex method Intelligent systems Linear programming Mathematical programming Matrix converters Minimization Ranking and selection
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!