Using complementary slackness property to solve linear programming with fuzzy parameters

The most popular approach to handle the challenge of solving fuzzy linear programming problems is to convert the fuzzy linear programming into the corresponding deterministic linear programming. Mahdavi-Amiri and Nasseri [15,16] developed the fuzzy dual simplex algorithm to fuzzy linear programming...

Full description

Saved in:
Bibliographic Details
Published in:Fuzzy information and engineering Vol. 1; no. 3; pp. 233 - 245
Main Authors: Ebrahimnejad, A., Nasseri, S. H.
Format: Journal Article
Language:English
Published: Berlin/Heidelberg Springer-Verlag 01.09.2009
Taylor & Francis Group
Subjects:
ISSN:1616-8658, 1616-8666
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The most popular approach to handle the challenge of solving fuzzy linear programming problems is to convert the fuzzy linear programming into the corresponding deterministic linear programming. Mahdavi-Amiri and Nasseri [15,16] developed the fuzzy dual simplex algorithm to fuzzy linear programming with fuzzy parameters. In this paper, we use the complementary slackness to solve it without the need of a simplex tableau.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1616-8658
1616-8666
DOI:10.1007/s12543-009-0026-9