【摘要】 所谓 ＶＤ２算法是指由Ｖｉｄｉｇａｌ和 Ｄｉｒｅｃｔｏｒ于１９８２年提出的，用于求解中心设计问题的一种算法［１］．本文对算法中的拟凸（拟凹）的二次近似作一些分析，相出了它的不等价性（局部）并分析了解序列中的 Ｍｉｎｋｏｗｓｋｉ凸体的关系。本文以及由作者所提出的其他几篇报告［６－８］，构成了对ＶＤ２算法的某些数学分析。在［９］中又给出了最近的一些研究结果。更多还原

【Abstract】 This paper concerns the VD2 algorithm proposed by Vidigal and Director in 1982, and used to solve the Design Centering problem[1]. Firstly, some analyses for the quadratic approximation to a quasiconvex (quasiconcave) function are presented. In particular, it is pointed out that their quasiconvexities (locally) are not equivalent. Secondly, the relation between Minkowski convex bodies in the process carrying out the VD2 algorithm is analysed. This contribution is to be replaced after some papers by the present authors on the VD2 algorithm [6], [7], [8]. Some of new results will be presented in [9].更多还原