A hybrid direction algorithm for solving linear programs.
Mohand Ouamer BibiMohand BentobachePublished in: Int. J. Comput. Math. (2015)
Keyphrases
- linear program
- simplex method
- linear programming
- dynamic programming
- objective function
- linear programming problems
- optimization algorithm
- mathematical model
- computational complexity
- np hard
- learning algorithm
- primal dual
- mixed integer linear program
- extreme points
- combinatorial optimization
- convex hull
- convergence rate
- mixed integer
- knapsack problem
- strongly polynomial
- mixed integer program
- search algorithm
- randomly generated
- lower bound
- search space
- worst case
- special case