A Method for Enumerating All Extreme Points and Extreme Rays on Unbounded Polyhedron

摘要

In this paper, we discuss a method of identifying all extreme points and rays of an unbounded polyhedron given by a finite number of equations. We first briefly describe a method of identifying all extreme points of a bounded polyhedron given by linear inequalities. We then introduce a method which is similar to the big M method in linear programming to identify extreme points and rays on an unbounded polyhedron. Numerical examples are provided for illustration.