Please use this identifier to cite or link to this item:
Title: A method for enumerating all extreme points and extreme rays on unbounded polyhedron
Authors: Wei, Q
Yan, H 
Issue Date: 2005
Source: Journal of systems science & information, 2005, v. 3, no. 3, p. 603-610 How to cite?
Journal: Journal of systems science & information 
Abstract: 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.
Appears in Collections:Journal/Magazine Article

View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

Last Week
Last month
Citations as of Dec 9, 2018

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.