An Investigation of Interior-Point Algorithms for the Linear Transportation Problem
From MaRDI portal
Publication:4895602
DOI10.1137/S1064827593258280zbMath0858.90099OpenAlexW1996410010MaRDI QIDQ4895602
No author found.
Publication date: 14 October 1996
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1064827593258280
preconditioningconjugate gradientinterior-point algorithmlarge-scale problemspredictor correctorlinear transportation models
Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Iterative numerical methods for linear systems (65F10)
Related Items
Convex Relaxations for Permutation Problems ⋮ Unnamed Item ⋮ An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems ⋮ A hybrid algorithm for the solution of a single commodity spatial equilibrium model ⋮ Solving scalarized multi-objective network flow problems using an interior point method ⋮ Exterior point simplex-type algorithms for linear and network optimization problems ⋮ Fortran subroutines for network flow optimization using an interior point algorithm ⋮ Computational experience with exterior point algorithms for the transportation problem ⋮ Implementation of interior point methods for mixed semidefinite and second order cone optimization problems
