A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem

DOI10.1007/s00186-014-0480-yzbMath1308.65095OpenAlexW2014479920MaRDI QIDQ486939

Publication date: 19 January 2015

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-014-0480-y

zbMATH Keywords

linear programming application of nonlinear programming to feasibility problems strict linear-inequality feasibility strong polynomial method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Linear inequalities of matrices (15A39)

Uses Software

ART3+

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
A strongly polynomial algorithm for linear systems having a binary solution
New methods for linear inequalities
On the complexity of approximating the maximal inscribed ellipsoid for a polytope
A primal-dual interior point method whose running time depends only on the constraint matrix
A new algorithm for minimizing convex functions over convex sets
On the complexity of solving feasible systems of linear inequalities specified with approximate data
How partial knowledge helps to solve linear programs
A fast algorithm for solving a linear feasibility problem with application to intensity-modulated radiation therapy
La méthode des centres dans un espace topologique
Fundamentals of Computerized Tomography
On Chubanov's Method for Linear Programming
A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
Solvability and Consistency for Linear Equations and Inequalities
On the use of Cimmino's simultaneous projections method for computing a solution of the inverse problem in radiation therapy treatment planning
On the non-polynomiality of the relaxation method for systems of linear inequalities
Relaxation methods for image reconstruction
On Projection Algorithms for Solving Convex Feasibility Problems
Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
Location of the Maximum on Unimodal Surfaces
An Algorithm for Linear Inequalities and its Applications
The method of projections for finding the common point of convex sets
On a relaxation method of solving systems of linear inequalities
The Relaxation Method for Linear Inequalities
The Relaxation Method for Linear Inequalities

This page was built for publication: A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem