A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem (Q486939)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6387655
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem |
scientific article; zbMATH DE number 6387655 |
Statements
A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem (English)
0 references
19 January 2015
0 references
The author proposes a strongly polynomial-time algorithm for the strict homogeneous linear- inequality feasibility problem in the positive orthant, that is, to obtain \(x \in \mathbb R^n\), such that \(A x > 0\), \(x >0\), for an \(m \times n\) matrix \(A\), \(m \leq n\). An extension to the non-homogeneous linear feasibility problem is presented.
0 references
strict linear-inequality feasibility
0 references
linear programming
0 references
strong polynomial method
0 references
application of nonlinear programming to feasibility problems
0 references
0 references
0 references
0 references
0 references
0 references
0.823334813117981
0 references
0.8023815155029297
0 references
0.795921266078949
0 references
0.7938610911369324
0 references
0.7929017543792725
0 references
