Boolean linear programming problems for which there exist some lack of
precision of vague nature in the constraints are considered. An alpha
-cut-based approach is considered to solve them. Then, an algorithm pr
oviding a fuzzy solution is proposed and analyzed. The linking with ot
her known solution methods is also studied.