Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/6217
Title: New interval partitioning algorithms for global optimization problems
Authors: Chandra Sekhar Pedamallu
Keywords: DRNTU::Engineering::Mechanical engineering::Kinematics and dynamics of machinery
Issue Date: 2007
Source: Chandra, S. P. (2007). New interval partitioning algorithms for global optimization problems. Doctoral thesis, Nanyang Technological University, Singapore.
Abstract: 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.
URI: https://hdl.handle.net/10356/6217
DOI: 10.32657/10356/6217
Rights: Nanyang Technological University
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:MAE Theses

Files in This Item:
File Description SizeFormat 
MAE-THESES_69.pdf1.3 MBAdobe PDFThumbnail
View/Open

Page view(s) 50

343
Updated on May 10, 2021

Download(s) 5

513
Updated on May 10, 2021

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.