Post-optimality analysis of the optimal solution of a degenerate linear program using a pivoting algorithm.
Jan StallaertPublished in: Comput. Oper. Res. (2007)
Keyphrases
- optimal solution
- linear program
- linear programming
- np hard
- objective function
- simplex method
- search space
- dynamic programming
- knapsack problem
- linear programming problems
- mixed integer
- metaheuristic
- solution quality
- column generation
- semidefinite programming
- extreme points
- strongly polynomial
- branch and bound
- branch and bound algorithm
- computational complexity
- integer programming
- genetic algorithm
- convex hull
- particle swarm optimization
- lower bound
- global optimality
- simplex algorithm
- mixed integer linear program
- learning algorithm