一类凸规划最优解的形式表达式

A Form Representation of Optimal Solution for a Class of Convex Programming

对一类凸规划的最优解进行了讨论,以线性代数及实分析为工具,给出了最优解的形式表达式.为数值计算提供了新的途径.

In this paper,we discuss the optimal solution of a class of convex programming.By means of linear algebra and real analysis,a form representation of optimal solution has been given here,it may give us a new method of number calculation.The method is simpler than the dual mathod.