February 2014
Intermediate to advanced
300 pages
8h 5m
English
Optimization is often subject to complex constraints. Constraint-handling techniques form an important area of problem solving in optimization. There many constraint-handling methods that allow the algorithms to solve unconstrained optimization problems to solve constrained optimization problems efficiently. This chapter provides a basic overview of the common techniques used with nature-inspired algorithms.
Keywords
Constraint
Constraint-handling methods
KKT conditions
Lagrange multiplier
Feasibility method
Penalty method
Stochastic ranking
The optimization we have discussed so far is unconstrained, since we have not considered any constraints. A natural and important question is how to incorporate ...
Read now
Unlock full access