Abstract
Constrained Optimization Problems (COP’s) are encountered in many scientific fields concerned with industrial applications such as kinematics, chemical process optimization, molecular design, etc. When non-linear relationships among variables are defined by problem constraints resulting in non-convex feasible sets, the problem of identifying feasible solutions may become very hard. Consequently, finding the location of the global optimum in the COP is more difficult as compared to bound-constrained global optimization problems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have