arbiter
JournalsPricingAccount

Maximum penalty method to solve transportation problem

S. M. Kumbhar & H. T. Dinde

Journal of Statistics and Management Systems2026https://doi.org/10.47974/jsms-1495article
ABDC C
Weight
0.50

What the paper says

In this present article, we have proposed a method to obtain an Initial Basic Feasible Solution (IBFS) for the Transportation Problem. It is based on Maximum penalty where row penalty and column penalty is obtained by the average of Maximum and Minimum element of newly formed Transportation Table. Proposed method is illustrated with numerical examples and compared results with existing well known methods.

Open paper page →

Cite this paper

https://doi.org/https://doi.org/10.47974/jsms-1495

Or copy a formatted citation

@article{s.2026,
  title        = {{Maximum penalty method to solve transportation problem}},
  author       = {S. M. Kumbhar & H. T. Dinde},
  journal      = {Journal of Statistics and Management Systems},
  year         = {2026},
  doi          = {https://doi.org/https://doi.org/10.47974/jsms-1495},
}

Paste directly into BibTeX, Zotero, or your reference manager.

Flag this paper

Maximum penalty method to solve transportation problem

Flags are reviewed by the Arbiter methodology team within 5 business days.

Evidence weight

0.50

Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40

F · citation impact0.50 × 0.4 = 0.20
M · momentum0.50 × 0.15 = 0.07
V · venue signal0.50 × 0.05 = 0.03
R · text relevance †0.50 × 0.4 = 0.20

† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.