A polyhedron can be represented by a set of linear constraints,which we call “intersection-form”,or by a convex combination of finite extreme points and non-negative combination of finite extreme rays,which we call “sum-form”.To transfer a polyhedron between the “sum-form” and the “intersection-form” is a fundamental problem in the mathematical programming. This paper supplies a method of transferring the unbounded polyhedron of sum-form to its intersection-form by using the “Big-M Method”. Numberical examp...