Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomial cases

Miroslav Rada, Milan Hladík, Elif Garajová

We address the problem of testing weak optimality of a given solution of a given interval linear program. The problem was recently wrongly stated to be polynomially solvable. We di…