Commentary—Progress in Linear Programming

DOI10.1287/ijoc.6.1.15zbMath0798.90101MaRDI QIDQ4291493

Robert E. Bixby

Publication date: 10 May 1994

Published in: ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.6.1.15

zbMATH Keywords

barrier methods; large-scale linear programming

Mathematics Subject Classification ID

90C06: Large-scale problems in mathematical programming

90C05: Linear programming

Related Items

A New Algorithm To Solve Vehicle Routing Problems (VRPs), Combined projected gradient algorithm for linear programming, Interior point methods 25 years later, An efficient approach to updating simplex multipliers in the simplex algorithm, HOPDM (version 2. 12) -- a fast LP solver based on a primal-dual interior point method, The role of the augmented system in interior point methods, Pivot versus interior point methods: Pros and cons, An efficient simplex type algorithm for sparse and dense linear programs., Multiple centrality corrections in a primal-dual method for linear programming, Presolving in linear programming, A linear programming primer: from Fourier to Karmarkar, A primal heuristic for optimizing the topology of gas networks based on dual information, A sparse proximal implementation of the LP dual active set algorithm, Dual multilevel optimization