How to Deal with Constraints
Abstract
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 ...
Get Nature-Inspired Optimization Algorithms now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
