Mitiku, Semu(PhD)Gidey, Gebretsadik2018-07-162023-11-042018-07-162023-11-042013-06-27http://etd.aau.edu.et/handle/123456789/8585A function f de_ned on a given convex set X which can be expressed as a di_erence of two convex (continuous) functions is called d.c function or _-convex function. The functions which are Lipschitz and bounded variation are expressible as a d.c. function and since those family of d.c. functions form a linear space as well as a lattice, it admits many operations. The decomposition of a given function f as a d.c. functions is not unique. Choosing the better (minimal) decomposition is useful in describing the optimality conditions for d.c. optimizationenDifference of Convex(D.C.)Functions and Their MinimalDi_erence of Convex(D.C.) Functions and Their Minimal RepresentationsThesis