On the extremality of maximal dual feasible functions

Dual feasible functions have been used to compute bounds and valid inequalities for combinatorial optimization problems. Here, we analyze the properties of some of the best functions proposed so far. Additionally, we provide new results for composed functions. These results will allow improving the computation of bounds and valid inequalities.