Relaxation Methods for Linear Programs

DOI10.1287/moor.12.4.569zbMath0642.90068OpenAlexW2119234846MaRDI QIDQ3783839

Dimitri P. Bertsekas, Paul Tseng

Publication date: 1987

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.151.4323

zbMATH Keywords

monotropic programminggeneralized coordinate descent method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items

PERT and crashing revisited: Mathematical generalizations, An incremental primal-dual method for generalized networks, An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems, The symmetric travelling salesman problem. I: New fast lower bounds for the problem of optimal 2-matching, A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems, Relaxation methods for problems with strictly convex separable costs and linear constraints, Relaxation methods for monotropic programs, A survey of dynamic network flows, On the convergence of the affine-scaling algorithm, A primal-dual simplex method for linear programs

Uses Software

• RelaxIV