Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/60290
PIRA download icon_1.1View/Download Full Text
Title: The method of transferring the unbounded polyhedron of sum-form to its intersection-form
Other Title: 无界凸多面体由“和形式”向“交形式”的转化
Authors: Wei, Q
Wang, J
Yan, H 
Issue Date: 2004
Source: 系统工程理论与实践 (Systems engineering theory and practice), 2004, v. 24, no. 3, p. 87-90
Abstract: 凸多面体可以表示成一组线性不等式的交 ,称这种表示为凸多面体的“交形式”;同时 ,它也可以由其全部极点和对应的凸多面锥的全部极方向生成 ,称之为“和形式”.将一个凸多面体在“和形式”与“交形式”之间进行转化是数学规划中的一个基本问题 .本文使用类似线性规划中的“大 M-方法”,构造性地将无界凸多面体“和形式”的凸多面体转化为“交形式”,并用数值例子说明了该算法的应用过程 .
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 example is also given to demonstrate the processes of our transferring algorithm. 还原
Keywords: Unbounded polyhedron "Sum-form" "intersection-form" "Big-M Method
Publisher: 中国学术期刊(光盘版)电子杂志社
Journal: 系统工程理论与实践 (Systems engineering theory and practice) 
ISSN: 1000-6788
Rights: © 2004 中国学术期刊电子杂志出版社。本内容的使用仅限于教育、科研之目的。
© 2004 China Academic Journal Electronic Publishing House. It is to be used strictly for educational and research purposes.
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
WeI_Method_Transferring_Unbounded.pdf191.83 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page views

167
Last Week
1
Last month
Citations as of Apr 14, 2024

Downloads

35
Citations as of Apr 14, 2024

Google ScholarTM

Check


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