
26 Optimization: Algorithms and Applications
MDO problems. Gomory’s cutting plane method, zero-one problem, Balas’
method, branch-and-bound method, and so forth are discussed in Chapter10
on integer programming. Both deterministic and probabilistic aspects of
dynamic programming are discussed in Chapter11. See Figure 1.18 for a
quick glance at the organization of the book.
Chapter 2
1-D optimization
•
•
•
Test problem
Solution techniques
Comparison
Chapter 3
Unconstrained optimization
Chapter 4
Linear programming
•
•
•
•
Genetic algorithm
Simulated annealing
Particle swarm
optimization
ACO and tabu search
•
•
•
•
•
•
Graphical method
Standard form
Basic solution
Simplex ...