This book strives to provide a balanced coverage of efficient algorithms commonly used in solving mathematical optimization problems. It covers both the convectional algorithms and modern heuristic and metaheuristic methods. Topics include gradient-based algorithms such as Newton-Raphson method, steepest descent method, Hooke-Jeeves pattern search, Lagrange multipliers, linear programming, particle swarm optimization (PSO), simulated annealing (SA), and Tabu search. Multiobjective optimization including important concepts such as Pareto optimality and utility method is also described. Three Matlab and Octave programs so as to demonstrate how PSO and SA work are provided. An example of demonstrating how to modify these programs to solve multiobjective optimization problems using recursive method is discussed.

Скачать книгу бесплатно (pdf, 853 Kb)

---

Читать «Introduction to mathematical optimization»