ABSTRACT
Not all optimization problems are solvable in closed form. For that reason, more and more procedures are created to solve these problems. Quadratic programming and separable programming methods convert certain NLP into linear programs (see Bazaraa et al., 1993). Additionally, newer numerical optimization methods have been created such as simulated annealing, differential evolution, particle swarm optimization, genetic algorithms, and cuckoo search. We briefly describe these.
