Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomially-solvable cases.
Miroslav RadaMilan HladíkElif GarajováPublished in: Optim. Lett. (2019)
Keyphrases
- np hard
- optimal solution
- linear programming
- np hardness
- dynamic programming
- cost function
- polynomially solvable
- integer programming
- learning algorithm
- worst case
- simulated annealing
- search space
- mathematical model
- feasible solution
- computationally expensive
- knapsack problem
- objective function
- discrete tomography
- special case
- probabilistic model
- approximation algorithms
- computational complexity
- mixed integer
- worst case analysis
- neural network