New interval partitioning algorithms for global optimization problems
Chandra Sekhar Pedamallu
Date of Issue2007
School of Mechanical and Aerospace Engineering
The objective of this thesis is to develop a generic methodology, which can solve bound constrained optimization problems (BCOP), continuous constraint satisfaction problems (CCSP) and constrained optimization problems (COP). A new subdivision direction selection method is proposed in this research for these problems.
DRNTU::Engineering::Mechanical engineering::Kinematics and dynamics of machinery
Nanyang Technological University