Optimization With D.c. Data. (difference Of Convex Functions Or Sets)

This semmar paper reviews the theory, methods and algorithm for so lving d.crnoptimization, as has been developed in recent years.rnIn chapter one ofthis paper some fundamental concepts and definitions are discussed.rnChapter two focuses on the motivation, basic classification of global optimization,rnsome typical examples of d.c.programming problems that are encountered in variousrnfie lds and properties of d.c.functions and d.c.sets.rnChapter three is devoted to the concept of duality in the d.c optimization and chapterrnfour discusses global and local optimality criteria and also so lution methods for d.crnoptimization.rnFinally I would like to express my heart felt thanks to my adviser Dr. Semu Mitiku forrnhis valuable comments and suggestions during the preparation of this graduate report.rnI am also grateful to my sister Frehiwot Geremew who is always willing to take care ofrnme.rnI sincerely express my gratitude to all those who have helped me in this endeavor.

Get Full Work

Report copyright infringement or plagiarism