matlab polytope,matlab将凸约束不等式转化为一组顶点

CON2VERT 是一个MATLAB函数,用于将凸集的不等式约束转换为其交点的顶点集合,即解决“顶点枚举”问题。该函数将不等式系统 A*x <= b 定义的多面体(凸多边形、多面体等)转换为顶点列表。注意,高维中可能出现重复顶点,并且程序要求可行区域在所有维度上都有有限范围。
摘要由CSDN通过智能技术生成

CON2VERT - constraints to vertices

CON2VERT - convert a convex set of constraint inequalities into the set of vertices at the intersections of those inequalities;i.e., solve the "vertex enumeration" problem.

V = con2vert(A,b)

Converts the polytope (convex polygon, polyhedron, etc.) defined by the system of inequalities A*x <= b into a list of vertices V. Each ROW of V is a vertex. For n variables:

A = m x n matrix, where m >= n (m constraints, n variables)

b = m x 1 vector (m constraints)

V = p x n matrix (p vertices, n variables)

NOTES:

(1) This program emplyes a primal-dual polytope method.

(2) In dimensions higher than 2, duplicate vertices can appear using this method. This program detects duplicates at up to twelve digits of precision, then returns the unique vertices.

(3) Non-bounding constraints give erroneous results;

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值