On relaxation methods for systems of linear inequalities

DOI10.1016/0377-2217(82)90071-6zbMath0476.65041MaRDI QIDQ1159953

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

feasible solution; relaxation methods; polynomially bounded algorithm; Khachian's algorithm

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C05: Linear programming

Related Items

New iterative methods for linear inequalities, A review of combinatorial problems arising in feedforward neural network design, Block-iterative surrogate projection methods for convex feasibility problems, The MIN PFS problem and piecewise linear model estimation, A class of methods for solving large convex systems

Cites Work

• On defining sets of vertices of the hypercube by linear inequalities
• The simplex algorithm with the pivot rule of maximizing criterion improvement
• Khachiyan’s algorithm for linear programming
• A bad network problem for the simplex method and other minimum cost flow algorithms
• Gradient methods for solving equations and inequalities
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities
• The complexity of linear programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item