On the Complexity of Solving Feasible Linear Programs Specified with Approximate Data (Q4702320): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:53, 7 February 2024
scientific article; zbMATH DE number 1368650
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Complexity of Solving Feasible Linear Programs Specified with Approximate Data |
scientific article; zbMATH DE number 1368650 |
Statements
On the Complexity of Solving Feasible Linear Programs Specified with Approximate Data (English)
0 references
24 November 1999
0 references
complexity of linear programming
0 references
approximate data
0 references
approximate solutions
0 references
condition measures
0 references
knowledge
0 references
