This paper deals with boolean linear programming problems involving co
efficients in the objective function as fuzzy numbers. In the study of
these problems different approaches can be proposed to use ranking fu
zzy numbers methods and fuzzy preference relations obtaining auxiliary
classical boolean programming problems, and to use the representation
theorem obtaining a convex set with extreme points defined by the low
er or upper bound of the alpha-level sets of the fuzzy coefficients, a
nd consequently an auxiliary interval boolean programming problem. In
this paper we develop and link the different approaches.