More for less method to minimize the unit transportation cost of a capacitated transportation problem with bounds on rim conditions

DOI10.1007/S12597-016-0288-ZzbMath1397.90061OpenAlexW2550748018MaRDI QIDQ1788849

Kavita Gupta, Ritu Arora

Publication date: 9 October 2018

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12597-016-0288-z

zbMATH Keywords

transportation problemoptimal solutionfeasible solutioncapacitatedmore for less methodunit transportation cost

Mathematics Subject Classification ID

Linear programming (90C05) Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (2)

An Iterative Solution Technique to Minimize the Average Transportation Cost of Capacitated Transportation Problem with Bounds on Rim Conditions ⋮ A heuristic for obtaining better initial feasible solution to the transportation problem

Cites Work

• Bottleneck capacitated transportation problem with bounds on rim conditions
• Capacitated transportation problem with bounds on rim conditions
• Submodularity and valid inequalities in capacitated fixed charge networks
• An algorithm for solving a capacitated indefinite quadratic transportation problem with enhanced flow
• CAPACITATED TWO-STAGE TIME MINIMIZATION TRANSPORTATION PROBLEM
• Unnamed Item

This page was built for publication: More for less method to minimize the unit transportation cost of a capacitated transportation problem with bounds on rim conditions