A fuzzy primal simplex algorithm and its application for solving flexible linear programming problems
by S.H. Nasseri, A. Ebrahimnejad
European J. of Industrial Engineering (EJIE), Vol. 4, No. 3, 2010

Abstract: One of the most interesting models of the linear programming is the flexible linear programming problem. It is shown that by using a suitable membership function for their constraints, we can obtain an equivalent Fuzzy Variable Linear Programming (FVLP) problem. Some methods have been developed for solving these problems by introducing and solving a certain auxiliary problem. Here, we first propose a fuzzy primal simplex algorithm for solving the flexible linear programming problem and then suggest the fuzzy primal simplex method to solve the flexible linear programming problems directly without solving any auxiliary problem. This method will also be especially useful for sensitivity analysis using the primal simplex tableaus. Thereafter, we shall illustrate our method with some examples. [Received 05 April 2008; Revised 05 October 2008; Revised 14 September 2009; Accepted 15 September 2009]

Online publication date: Tue, 01-Jun-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