Knapsack feasibility as an absolute value equation solvable by successive linear programming.
O. L. MangasarianPublished in: Optim. Lett. (2009)
Keyphrases
- linear programming
- feasible solution
- np hard
- dynamic programming
- optimal solution
- knapsack problem
- linear program
- special case
- np complete
- greedy heuristic
- objective function
- quadratic programming
- upper bound
- nonlinear programming
- packing problem
- integer programming
- column generation
- network flow
- simplex algorithm
- numerical methods
- website
- artificial intelligence
- neural network
- differential equations
- primal dual
- computational complexity
- numerical solution
- lp relaxation
- real world
- databases