scientific article
From MaRDI portal
Publication:3869076
zbMath0431.90043MaRDI QIDQ3869076
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Linear programming (90C05)
Related Items (14)
The basic solution ellipsoid method approach for the efficiency measurement problems ⋮ A multiplicative barrier function method for linear programming ⋮ Single-projection procedure for linear optimization ⋮ Projection method for solving systems of linear inequalities ⋮ Avoiding slack variables in the solving of linear diophantine equations and inequations ⋮ Line configuration to minimize setup costs ⋮ On a problem of integer optimization ⋮ An extension of Chubanov's polynomial-time linear programming algorithm to second-order cone programming ⋮ Scientific contributions of Leo Khachiyan (a short overview) ⋮ The sphere method and the robustness of the ellipsoid algorithm ⋮ On the existence of Hamiltonian paths for history based pivot rules on acyclic unique sink orientations of hypercubes ⋮ Unnamed Item ⋮ An orthogonal descent algorithm to find the zero of a convex function, unsolvability test, and rate of convergence ⋮ Pivot rules for linear programming: A survey on recent theoretical developments
This page was built for publication:
