A simple polynomial-time rescaling algorithm for solving linear programs (Q5900037)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A simple polynomial-time rescaling algorithm for solving linear programs |
scientific article; zbMATH DE number 5281955
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple polynomial-time rescaling algorithm for solving linear programs |
scientific article; zbMATH DE number 5281955 |
Statements
A simple polynomial-time rescaling algorithm for solving linear programs (English)
0 references
3 June 2008
0 references
This paper presents an algorithm for the linear feasibility problem consisting of m constraints in \(n\) dimensions. The developed algorithm is iterative and the perceptron phase uses a modified version of the basic algorithm. A number of theorems and lemmas are developed for the theoretical foundation but no numerical experiments are performed for validation.
0 references
greedy method
0 references
perceptron algorithm
0 references
0.93411136
0 references
0.9042594
0 references
0.8955363
0 references
0.8938801
0 references
0.89206666
0 references
0.89061856
0 references
0.89053625
0 references
