Linear programmes with trapezoidal fuzzy numbers: a duality approach
by Ali Ebrahimnejad; S.H. Nasseri
International Journal of Operational Research (IJOR), Vol. 13, No. 1, 2012

Abstract: Solving fuzzy linear programming problems have received a great deal of attention. Recently, Ganesan and Veeramani (2006) developed a new method for solving a kind of these problems involving symmetric trapezoidal fuzzy numbers without converting them to the crisp linear programming problems based on primal simplex method. But their method has no efficient when a primal basic feasible solution is not at hand. In this paper, we develop a new dual simplex algorithm to overcome this shortcoming by using the duality results which has been proposed by Nasseri and Mahdavi-Amiri (2009) and Nasseri et al. (2010). This algorithm starts with a dual basic feasible solution, but primal basic infeasible solution and walks to an optimal solution by moving among adjacent dual basic feasible solution.

Online publication date: Sun, 11-Jan-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com