On the bottleneck linear programming problem
From MaRDI portal
Publication:1161448
DOI10.1016/0377-2217(82)90178-3zbMath0478.90051OpenAlexW1965349047MaRDI QIDQ1161448
Publication date: 1982
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(82)90178-3
primal methodbottleneck transportation problemauxiliary coefficientsbottleneck linear programmingdegenerate basic feasible solution
Numerical mathematical programming methods (65K05) Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items (7)
A bilevel bottleneck programming problem ⋮ On bilevel fractional programming ⋮ Systematic construction of examples for cycling in the simplex method ⋮ Bottleneck flows in unit capacity networks ⋮ An efficient heuristic algorithm for the bottleneck traveling salesman problem ⋮ The stochastic bottleneck linear programming problem ⋮ Selected bibliography on degeneracy
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Duality for algebraic linear programming
- On the bottleneck assignment problem
- A procedure for time minimization transportation problem
- An augmenting path method for solving linear bottleneck transportation problems
- A min max problem
- Bottleneck Linear Programming
- Bottleneck linear programming
- Algorithms for minimizing total cost, bottleneck time and bottleneck shipment in transportation problems
- Some remarks on the time transportation problem
- Time‐minimizing transportation problems
- Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
- 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 the bottleneck linear programming problem