An extension of D.C. duality theory, with an appendix on ∗-subdifferentials

We present some results extending d.c. duality theory to the generalized convex setting.Given a binary operation ∗ on the extended real line, we consider the problem of minimizingƒ∗–hwithƒ and h being functions defined on an arbitrary set. For this problem. we obtain results which encompass, as particular cases, some well known duality theorems for the infimum of the difference of two functions and the infimum of the maximum of two functions, as well as some well known formulae for the conjugate of the difference of two functions and the conjugate of type Lau of the maximum of two functions. Instead of considering the Fenchel conjugation operator, our results are expressed with the aid of dualities which are associated to the operation ∗.We also study. for such dualities, the corresponding generalized subdifferential