The algorithm of finding all paradoxical pairs in a linear transportation problem

DOI10.1142/S1793830912500498zbMATH Open1262.90093OpenAlexW2115158534MaRDI QIDQ4903634FDOQ4903634

Authors: 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

Recommendations

• scientific article; zbMATH DE number 223300
• scientific article; zbMATH DE number 446522
• On the more-for-less paradoxical situations in linear programs: A parametric optimization approach
• A paradox in linear fractional transportation problems with mixed constraints
• Paradox in a non-linear capacitated transportation problem

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

• The Distribution of a Product from Several Sources to Numerous Localities
• The Transportation Problem with Mixed Constraints
• The Transportation Problem and its Variants
• The transportation paradox
• Solving Constrained Transportation Problems
• Title not available (Why is that?)
• A paradox in linear fractional transportation problems with mixed constraints

Cited In (4)

• Title not available (Why is that?)
• A paradox in linear fractional transportation problems with mixed constraints
• Which matrices are immune against the transportation paradox?
• Title not available (Why is that?)

This page was built for publication: The algorithm of finding all paradoxical pairs in a linear transportation problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4903634)