Abstract: It is pointed out that optimal solution of linear programming can be represented as a sum of a convex combination of the optimal extreme points and a nonnegatively linear combination of the optimal extreme directions. The existential condition of optimal extreme direction is determined.