Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/31919
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.
URI: http://hdl.handle.net/10397/31919
Appears in Collections:Journal/Magazine Article

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

Page view(s)

36
Last Week
1
Last month
Checked on Sep 17, 2017

Google ScholarTM

Check



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