scientific article; zbMATH DE number 3538745

zbMath0345.65034MaRDI QIDQ4114710

Michael A. Saunders

Publication date: 1976

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items (11)

Dynamic factorization in large-scale optimization ⋮ A numerically stable reduced-gradient type algorithm for solving large- scale linearly constrained minimization problems ⋮ Permutations in the Factorization of Simplex Bases ⋮ A bump triangular dynamic factorization algorithm for the simplex method ⋮ Large-scale linearly constrained optimization ⋮ The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results ⋮ A degeneracy exploiting LU factorization for the simplex method ⋮ Large-scale linear programming: Geometry, working bases and factorizations ⋮ The octahedral algorithm, a new simplicial fixed point algorithm ⋮ Solving staircase linear programs by the simplex method, 1: Inversion ⋮ Stable modification of explicitLU factors for simplex updates

This page was built for publication: