Smoothing-type algorithm for solving linear programs by using an augmented complementarity problem.
Zheng-Hai HuangHui WangPublished in: Appl. Math. Comput. (2006)
Keyphrases
- linear program
- linear programming
- simplex method
- dynamic programming
- optimal solution
- learning algorithm
- computational complexity
- linear programming problems
- strongly polynomial
- objective function
- nelder mead
- simplex algorithm
- integer program
- optimization algorithm
- np hard
- mathematical model
- randomly generated
- combinatorial optimization
- knapsack problem
- primal dual
- particle swarm optimization
- worst case
- semi infinite
- multi objective
- search space