On trade-off solution pairs in a special type of transportation problem

DOI10.1007/BF02866902zbMath0537.90073OpenAlexW1996382169MaRDI QIDQ792881

V. G. Tikekar, K. K. Achary

Publication date: 1983

Published in: Proceedings of the Indian Academy of Sciences. Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02866902

zbMATH Keywords

bicriteria transportationpiecewise constant increasing functiontime objectivetrade-off solution pairs

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Time-cost tradeoff in a multidimensional transportation problem. I
• On Sharma-Swarup algorithm for time minimising transportation problems
• A procedure for time minimization transportation problem
• An augmenting path method for solving linear bottleneck transportation problems
• Bicriteria Transportation Problem
• Algorithms for minimizing total cost, bottleneck time and bottleneck shipment in transportation problems
• Technical Note—Cost/Completion-Date Tradeoffs in the Transportation Problem
• The enumeration of all efficient solutions for a linear multiple-objective transportation problem
• Some remarks on the time transportation problem
• Time‐minimizing transportation problems
• Communication on “the bottleneck transportation problem” and “some remarks on the time transportation problem”
• The bottleneck transportation problem

This page was built for publication: On trade-off solution pairs in a special type of transportation problem