scientific article; zbMATH DE number 3672004

MaRDI QIDQ3869076zbMATH OpenFDO

Authors Leonid G. Khachiyan

Publication date 1980

zbMATH Keywords

computational complexitylarge-scale linear programmingpolynomial algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Large-scale problems in mathematical programming (90C06)

Cited in

(17)

• A multiplicative barrier function method for linear programming
• Projection method for solving systems of linear inequalities
• Pivot rules for linear programming: A survey on recent theoretical developments
• Avoiding slack variables in the solving of linear diophantine equations and inequations
• An orthogonal descent algorithm to find the zero of a convex function, unsolvability test, and rate of convergence
• Line configuration to minimize setup costs
• The sphere method and the robustness of the ellipsoid algorithm
• Single-projection procedure for linear optimization
• An extension of Chubanov's polynomial-time linear programming algorithm to second-order cone programming
• The basic solution ellipsoid method approach for the efficiency measurement problems
• scientific article; zbMATH DE number 7559394 (Why is no real title available?)
• Computing a common prior
• An optimality criterion for disjoint bilinear programming and its application to the problem with an acute-angled polytope for a disjoint subset
• On the existence of Hamiltonian paths for history based pivot rules on acyclic unique sink orientations of hypercubes
• Polynomial algorithm for the disjoint bilinear programming problem with an acute-angled polytope for a disjoint subset
• On a problem of integer optimization
• Scientific contributions of Leo Khachiyan (a short overview)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3869076)