On relaxation methods for systems of linear inequalities

DOI10.1016/0377-2217(82)90071-6zbMATH Open0476.65041OpenAlexW1999437445MaRDI QIDQ1159953FDOQ1159953

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Gradient methods for solving equations and inequalities
• Title not available (Why is that?)
• The simplex algorithm with the pivot rule of maximizing criterion improvement
• Title not available (Why is that?)
• A bad network problem for the simplex method and other minimum cost flow algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• The complexity of linear programming

Cited In (10)

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

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)