Please use this identifier to cite or link to this item:
Title: On minimal generators for semi-closed polyhedra
Authors: Fang, YP
Meng, KW
Yang, XQ 
Keywords: Generators
Minimal representation
Refining criteria
Semi-closed polyhedra
Issue Date: 2015
Publisher: Taylor and Francis Ltd.
Source: Optimization, 2015, v. 64, no. 4, p. 761-770 How to cite?
Journal: Optimization 
Abstract: A semi-closed polyhedron is defined as the intersection of finitely many closed and/or open half-spaces, which can be regarded as an extension of a polyhedron. The same as a polyhedron, a semi-closed polyhedron admits both (Formula presented.) -representation and (Formula presented.) -representation. In this paper, we introduce the concept of a minimal (Formula presented.) -representation for semi-closed polyhedra which can be regarded as a natural extension of a minimal (Formula presented.) -representation for polyhedra. We derive some criteria for refining generators of a semi-closed polyhedron. These refining criteria can be applied to obtain a minimal generator for a semi-closed polyhedron.
ISSN: 0233-1934
DOI: 10.1080/02331934.2013.820299
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
Checked on Mar 26, 2017

Google ScholarTM



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