Results 61 to 70 of about 3,135,949 (80)
Bounded Primal Simplex Algorithm for Bounded Linear Programming with Fuzzy Cost Coefficients
International Journal of Operations Research and Information Systems, 2011 In most practical problems of linear programming problems with fuzzy cost coefficients, some or all variables are restricted to lie within lower and upper bounds. In this paper, the authors propose a new method for solving such problems called the bounded fuzzy primal simplex algorithm.
Ali Ebrahimnejad +2 more
exaly +4 more sources
Some of the next articles are maybe not open access.
International Journal of Operational Research, 2013
Recently, Ebrahimnejad (2011) generalised the primal-dual simplex algorithm for solving a class of fuzzy linear programming (FLP) problems involving symmetric trapezoidal fuzzy numbers without converting them to crisp linear programming problems. In this paper, we describe the fuzzy primal-dual algorithm in tableau form and illustrate our approach by a
Ali Ebrahimnejad
openaire +3 more sources
Recently, Ebrahimnejad (2011) generalised the primal-dual simplex algorithm for solving a class of fuzzy linear programming (FLP) problems involving symmetric trapezoidal fuzzy numbers without converting them to crisp linear programming problems. In this paper, we describe the fuzzy primal-dual algorithm in tableau form and illustrate our approach by a
Ali Ebrahimnejad
openaire +3 more sources
European J. of Industrial Engineering, 2010
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.
S.H. Nasseri, A. Ebrahimnejad
openaire +3 more sources
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.
S.H. Nasseri, A. Ebrahimnejad
openaire +3 more sources
Initial Basic Solution for the Fuzzy Primal Simplex Algorithm Using a Two-Phase Method
Advances in Intelligent and Soft Computing, 2012Fuzzy primal and dual simplex algorithms have been recently proposed to solve the linear programming with fuzzy variables (FVLP) problems. The fuzzy primal simplex method has been developed with the assumption that an initial basic feasible solution is at hand.
S. H. Nasseri, Z. Alizadeh, B. Khabiri
openaire +3 more sources
A Primal–Dual Simplex Algorithm for Bi-Objective Network Flow Problems
4or, 2009 In this paper we develop a primal–dual simplex algorithm for the bi-objective linear minimum cost network flow problem. This algorithm improves the general primal–dual simplex algorithm for multi-objective linear programs by Ehrgott et al.
José Figueira +2 more
exaly +6 more sources
An Improved Primal Simplex Algorithm for Degenerate Linear Programs
INFORMS Journal on Computing, 2011 Since its appearance in 1947, the primal simplex algorithm has been one of the most popular algorithms for solving linear programs. It is often very efficient when there is very little degeneracy, but it often struggles in the presence of high ...
François Soumis, Guy Desaulniers
exaly +2 more sources
Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem
Mathematics of Operations Research, 1991Robert Tarjan
exaly