In this paper we describe the normal cones to a polyhedral convex set and their polarity with the faces of the set. Then we express optimaltity conditions in terms of negative normal cones and propose a method for generating efficient solution faces of a linear multiobjective programming problem together with some computational examples.