Khachiyan’s algorithm for linear programming
From MaRDI portal
Publication:3914757
DOI10.1007/BFb0120921zbMath0463.90066MaRDI QIDQ3914757
Publication date: 1981
Published in: Mathematical Programming Studies (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
90C05: Linear programming
65F10: Iterative numerical methods for linear systems
Related Items
Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses, The \(p\)-hub center allocation problem, The vertices of the knapsack polytope, Neighborhood perfect graphs, Complexity, convexity and combinations of theories, On relaxation methods for systems of linear inequalities, The ellipsoid method and its consequences in combinatorial optimization, An appraisal of computational complexity for operations researchers, Projection algorithms for linear programming, Method of centers for minimizing generalized eigenvalues, New iterative methods for linear inequalities, Simplices by point-sliding and the Yamnitsky-Levin algorithm, Fast finite methods for a system of linear inequalities, The ellipsoid method and its implications, The sphere method and the robustness of the ellipsoid algorithm, Fractional covers for forests and matchings, Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games, A Variable-Complexity Norm Maximization Problem, A finite algorithm for the continuousp-center location problem on a graph, On Estimating Optimal Bases for Linear Programs, Modifications and implementation of the ellipsoid algorithm for linear programming
