Complexity and computability of solutions to linear programming systems (Q3898028)
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 3705905
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity and computability of solutions to linear programming systems |
scientific article; zbMATH DE number 3705905 |
Statements
Complexity and computability of solutions to linear programming systems (English)
0 references
1980
0 references
computability
0 references
linear programming systems
0 references
constraint contraction algorithms
0 references
ellipsoidal algorithms
0 references
nondifferentiable convex programming
0 references
interval programming
0 references
0 references
