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

Full description

Saved in:
Bibliographic Details
Main Author: Chandra Sekhar Pedamallu
Other Authors: Arun Kumar
Format: Theses and Dissertations
Published: 2008
Subjects:
Online Access:https://hdl.handle.net/10356/6217
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University

Similar Items