Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomially-solvable cases (Q2311118)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomially-solvable cases |
scientific article |
Statements
Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomially-solvable cases (English)
0 references
10 July 2019
0 references
interval linear programming
0 references
weakly optimal solution
0 references
weak optimality testing
0 references
0 references
0 references
0 references
0 references
0 references
