Nonlinear programming problems are known to be difficult to solve, especially those that involve a multimodal objective function and/or non-convex and at the same time disjointed solution space. Heuristic methods that do not require derivative calculations have been used to solve this type of constrained problems. The most used constraint-handling technique has been the penalty method. This method converts the ...
Financiadores do RCAAP | |||||||
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |