On relaxation methods for systems of linear inequalities

DOI10.1016/0377-2217(82)90071-6MaRDI QIDQ1159953zbMATH OpenOpenAlexFDO

Authors Jan Telgen

Publication date 1982

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(82)90071-6

zbMATH Keywords

relaxation methodsfeasible solutionpolynomially bounded algorithmKhachian's algorithm

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3423501 (Why is no real title available?)
• scientific article; zbMATH DE number 3744912 (Why is no real title available?)
• scientific article; zbMATH DE number 3466805 (Why is no real title available?)
• scientific article; zbMATH DE number 3637614 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3449757 (Why is no real title available?)
• scientific article; zbMATH DE number 3232960 (Why is no real title available?)
• scientific article; zbMATH DE number 3194067 (Why is no real title available?)
• A bad network problem for the simplex method and other minimum cost flow algorithms
• Gradient methods for solving equations and inequalities
• Khachiyan’s algorithm for linear programming
• On defining sets of vertices of the hypercube by linear inequalities
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities
• The complexity of linear programming
• The simplex algorithm with the pivot rule of maximizing criterion improvement

Cited in

(10)

• Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes
• On Chubanov's Method for Linear Programming
• A sampling Kaczmarz-Motzkin algorithm for linear feasibility
• A class of methods for solving large convex systems
• A review of combinatorial problems arising in feedforward neural network design
• Greed Works: An Improved Analysis of Sampling Kaczmarz--Motzkin
• Block-iterative surrogate projection methods for convex feasibility problems
• The MIN PFS problem and piecewise linear model estimation
• New iterative methods for linear inequalities
• Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration

This page was built for publication: On relaxation methods for systems of linear inequalities

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