New interval partitioning algorithms for global optimization problems

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...

Celý popis

Podrobná bibliografie
Hlavní autor: Chandra Sekhar Pedamallu
Další autoři: Arun Kumar
Médium: Diplomová práce
Vydáno: 2008
Témata:
On-line přístup:https://hdl.handle.net/10356/6217