Complexity and computability of solutions to linear programming systems (Q3898028): Difference between revisions
From MaRDI portal
Latest revision as of 10:13, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Complexity and computability of solutions to linear programming systems |
scientific article |
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