• 论文 •

### 正定几何规划的相关退化问题

• 出版日期:1983-04-14 发布日期:1983-04-14

### ON THE DEPENDENT DEGENERACY OF POLYNOMIAL PROGRAMMING

1. Xu Xue-wen Beijing Document Service
• Online:1983-04-14 Published:1983-04-14
n_k-1,k=0,1,…,r-1;n_r=n,n为所有 f_k(t)(k=0,1,…,r)包含的总项数,n_k-m_k+1为f_k(t)包含的项数. 它的目标函数取对数形式的对偶规划D:
When the optimal dual Lagrange multipliers are not unique, subsidiary problems areneeded. In this paper, subsidiary problems are described as nonlinear inequalities. if neces-sary. In some cases the inequalities are very simple and all of the solutions can be found.
()
 [1] L. S. Duffin, E. L. Peterson, C. Zener, Geomitric Programming: Theory and Applications, John wiley and Sons, New York, 1967． [2] P. A. Beck, J. G. Ecker. A Modified Concave Simplex Algorithm for Geometric Programming,J. O. T. A., Vol.15, No. 2, 1975． [3] R. T. Rockafellar, Some Convex Programs Whose Duals are Linearly Constrained Non Linear Programming Edited by J. B. Rosen, O. L. Mangasarian, and K.Ritter, Academic Press, New York, 1970． [4] R. S. Dembo, Dual to Primal Conversion in Geometric Programming, J. O. T A., Vol. 26, No. 2,1978． [5] 徐学文,一个正定几何规划的对偶算法,计算数学,5:3(1983) ,295-309,
 No related articles found!