)-algorithm for solving a special class of linear programs.
Wolfgang W. BeinPeter BruckerPublished in: Computing (1989)
Keyphrases
- linear program
- linear programming
- dynamic programming
- simplex method
- np hard
- primal dual
- learning algorithm
- linear programming problems
- optimal solution
- strongly polynomial
- simulated annealing
- integer program
- objective function
- computational complexity
- simplex algorithm
- nelder mead
- convergence rate
- optimization algorithm
- worst case