Reverse convex programming
Reverse convex programming
复制标题
DOI：
10.1007/bf01442883
复制
发表时间：
1980-03
影响因子：
1.8
通讯作者：
R. Hillestad;S. E. Jacobsen
中科院分区：
文献类型：
--
作者：
R. Hillestad;S. E. Jacobsen
反凸规划通常具有不连通的可行域。基本解决方案的定义和性质，后者和凸船体的可行域推导。讨论了求解过程，并提出了一种割平面算法。
Reverse convex programs generally have disconnected feasible regions. Basic solutions are defined and properties of the latter and of the convex hull of the feasible region are derived. Solution procedures are discussed and a cutting plane algorithm is developed.