A streamlined simplex approach to the singly constrained transportation problem

DOI10.1002/nav.3800250410zbMath0395.90052OpenAlexW2008188146MaRDI QIDQ4178779

Roberta S. Russell, Darwin D. Klingman

Publication date: 1978

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800250410

zbMATH Keywords

Simplex AlgorithmComputational EfficiencyLinear ProgrammingDouble Reverse MethodSingly Constrained Transportation Problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (5)

Dynamic factorization in large-scale optimization ⋮ The singly constrained assignment problem: An AP basis algorithm ⋮ A network simplex method for the budget-constrained minimum cost flow problem ⋮ A specialized network simplex algorithm for the constrained maximum flow problem ⋮ The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm

Cites Work

• Unnamed Item
• A High-Speed Computer Technique for the Transportation Problem
• Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems

This page was built for publication: A streamlined simplex approach to the singly constrained transportation problem