THE ALGORITHM OF FINDING ALL PARADOXICAL PAIRS IN A LINEAR TRANSPORTATION PROBLEM

DOI10.1142/S1793830912500498zbMath1262.90093OpenAlexW2115158534MaRDI QIDQ4903634

Debi Prasad Acharya, Atanu Das, Manjusri Basu

Publication date: 24 January 2013

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830912500498

zbMATH Keywords

transportation problemparadoxical range of flow

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Cites Work

• A paradox in linear fractional transportation problems with mixed constraints
• Solving Constrained Transportation Problems
• The Transportation Problem with Mixed Constraints
• The transportation paradox
• The Transportation Problem and its Variants
• The Distribution of a Product from Several Sources to Numerous Localities
• Unnamed Item

This page was built for publication: THE ALGORITHM OF FINDING ALL PARADOXICAL PAIRS IN A LINEAR TRANSPORTATION PROBLEM