Solving Linear Programming Problem with Fuzzy Right Hand Sides a Penalty Method


Authors

S. H. Nasseri - Department of Mathematics, University of Mazandaran, Babolsar, Iran Z. Alizadeh - Department of Mathematics, University of Mazandaran, Babolsar, Iran


Abstract

Linear programming problems with trapezoidal fuzzy variables (FVLP) have recently attracted some interest. Some methods have been developed for solving these problems. Fuzzy primal and dual simplex algorithms have been recently proposed to solve these problems. These methods have been developed with the assumption that an initial Basic Feasible Solution (BFS) is at hand. In many cases, finding such a BFS is not straightforward and some works may be needed to get the simplex algorithm started. In this paper, we propose a penalty method to solve FVLP problems in which the BFS is not readily available.


Share and Cite

  • Share on Facebook
  • Share on Twitter
  • Share on LinkedIn
ISRP Style

S. H. Nasseri, Z. Alizadeh, Solving Linear Programming Problem with Fuzzy Right Hand Sides a Penalty Method, Journal of Mathematics and Computer Science, 3 (2011), no. 3, 318--328

AMA Style

Nasseri S. H., Alizadeh Z., Solving Linear Programming Problem with Fuzzy Right Hand Sides a Penalty Method. J Math Comput SCI-JM. (2011); 3(3):318--328

Chicago/Turabian Style

Nasseri, S. H., Alizadeh, Z.. "Solving Linear Programming Problem with Fuzzy Right Hand Sides a Penalty Method." Journal of Mathematics and Computer Science, 3, no. 3 (2011): 318--328


MSC


References