摘要
对于约束集是凸集的(VDP)问题提出一种新的外逼近算法。该算法把凸集的使用多面集的外逼近程序和求解约束集是多胞形的(VDP)问题的外逼近算法相结合。给出了具体的算法过程并对收敛性进行分析。
This article presents a new outer approximation algorithm tor globally solving the problem （VDP） with convex constraints. This new algorithm applies the outer approximation algorithm of （VDP） problem with polytope constraints and outer approximation procedure of convex set. Here in the essay, the author presents rithm and analysizes its convergence. its special algorithm and analysizes its convergence.
出处
《河南机电高等专科学校学报》
CAS
2008年第4期46-47,54,共3页
Journal of Henan Mechanical and Electrical Engineering College
关键词
外逼近
凸集
算法
outer approximation
convex set
algorithm
