A dual simplex method for bounded linear programmes with fuzzy numbers

A. Ebrahimnejad and Seyed Hadi Nasseri

International Journal of Mathematics in Operational Research, 2010, vol. 2, issue 6, 762-779

Abstract: Fuzzy number linear programming problems have recently attracted some interests. Some authors used the concept of comparison of fuzzy numbers for solving fuzzy linear programming problems. In effect, most convenient methods are based on the concept of comparison of fuzzy numbers by use of ranking functions. But the existing methods are not useful for situations in which some or all variables are restricted to lie within fuzzy lower and fuzzy upper bounds. In this paper, we introduce a new method called the bounded dual simplex method for bounded fuzzy number linear programming problems which is useful for these situations. This algorithm constructs a dual feasible basic solution after obtaining a working basic and from there moves towards attaining primal feasibility while maintaining dual feasibility throughout.

Keywords: bounded linear programming; FNLP; fuzzy number linear programming; fuzzy ordering; TRFNs; trapezoidal fuzzy numbers. (search for similar items in EconPapers)
Date: 2010
References: Add references at CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://www.inderscience.com/link.php?id=35498 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:2:y:2010:i:6:p:762-779

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().