A primal-dual method for linear programming problems with fuzzy variables
by A. Ebrahimnejad, S.H. Nasseri, F. Hosseinzadeh Lotfi, M. Soltanifar
European J. of Industrial Engineering (EJIE), Vol. 4, No. 2, 2010

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 give a new primal-dual algorithm for solving linear programming problems with fuzzy variables by using duality results, which was proposed by Mahdavi-Amiri and Nasseri (2007). This algorithm will be useful for sensitivity analysis when the activity vectors change for basic columns. [Received 29 September 2008; Revised 16 March 2009; Accepted 17 April 2009]

Online publication date: Wed, 20-Jan-2010

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 European J. of Industrial Engineering (EJIE):
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