1989
DOI: 10.1057/palgrave.jors.0400607
|View full text |Cite
|
Sign up to set email alerts
|

A Simplex-type Algorithm for General Transportation Problems: An Alternative to Stepping-stone

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2014
2014
2019
2019

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(6 citation statements)
references
References 0 publications
0
6
0
Order By: Relevance
“…An economical come within reach of for scrutiny the fuzzy numbers is by the utilization of a ranking perform supported their hierarchal means. That is, for every (1) (2) a a = ∵ For, any two fuzzy triangular Fuzzy numbers (1) (2)…”
Section: Ranking Of Triangular Fuzzy Numbermentioning
confidence: 99%
“…An economical come within reach of for scrutiny the fuzzy numbers is by the utilization of a ranking perform supported their hierarchal means. That is, for every (1) (2) a a = ∵ For, any two fuzzy triangular Fuzzy numbers (1) (2)…”
Section: Ranking Of Triangular Fuzzy Numbermentioning
confidence: 99%
“…Therefore, keeping in view this feature of the simplex method a few noteworthy previous researchers e.g. Arsham and Khan [1], Arsham [2], Balinski and Gomory [3] among the others confined their attention in this direction and developed optimal solution for deterministic transportation models.…”
Section: Literature Reviewmentioning
confidence: 99%
“…In addition, logistics problems without shipment of commodities may be formulated as transportation problems [1]. For instance, the decision problem of minimizing dead kilometers (Raghavendra and Maharaja, 1987) [11] can be formulated as a transportation problem (Vasudevanet al,1993; Sridhar an, 1991) [18], [20].…”
Section: Introductionmentioning
confidence: 99%
“…Various methods are available to solve the transportation problem to obtain an optimal solution [16]. Typical/well-known transportation methods include the stepping stone method [2] (Charnes and Cooper, 1954), the modified distribution method (Dantzig, 1963), the modified stepping-stone method (Shih, 1987), the simplex-type algorithm (Arsham and Kahn, 1989) and the dual-matrix approach (Ji and Chu, 2002). Glover et al (1974) presented a detailed computational comparison of basic solution algorithms for solving the transportation problems [6], [18].…”
Section: Introductionmentioning
confidence: 99%