On a nonbasic dual method for the transportation problem

DOI10.1007/BFB0121088zbMATH Open0601.90106OpenAlexW51541274MaRDI QIDQ3737227

Claudio Sandi

Publication date: 1986

Published in: Mathematical Programming Studies (Search for Journal in Brave)

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

zbMATH Keywords

digraphrelaxationcomplementary slackness conditionssubgradient techniquesclassical transportation problemcolumn constraintsnonbasic methodsequence of strongly related shortest path problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Deterministic network models in operations research (90B10)

Related Items (4)

Nondominated solutions of cost-time trade-off transportation and assignment problems ⋮ A non improving simplex algorithm for transportation problems ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: On a nonbasic dual method for the transportation problem