On the Complexity of Solving Feasible Linear Programs Specified with Approximate Data (Q4702320): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/s1052623494268467 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1977644479 / rank | |||
Normal rank | |||
Latest revision as of 12:02, 30 July 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
