Linear Programming with Inexact Data is NP‐Hard (Q4228409): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2004388087 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3050157 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Checking robust nonsingularity is NP-hard / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Strong solvability of interval linear programming problems / rank | |||
Normal rank | |||
Latest revision as of 17:20, 28 May 2024
scientific article; zbMATH DE number 1248417
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear Programming with Inexact Data is NP‐Hard |
scientific article; zbMATH DE number 1248417 |
Statements
Linear Programming with Inexact Data is NP‐Hard (English)
0 references
2 February 1999
0 references
inexact data
0 references
NP-hard
0 references
