期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
MINIMUM DISCRIMINATION INFORMATION PROBLEMS VIA GENERALIZED GEOMETRIC PROGRAMMING 被引量:1
1
作者 Zhu DetongDept. of Math., Shanghai Normal Univ., Shanghai 200234,China. 《Applied Mathematics(A Journal of Chinese Universities)》 SCIE CSCD 2003年第1期103-114,共12页
In this paper,the quadratic program problem and minimum discrimination information (MDI) problem with a set of quadratic inequality constraints and entropy constraints of density are considered.Based on the properties... In this paper,the quadratic program problem and minimum discrimination information (MDI) problem with a set of quadratic inequality constraints and entropy constraints of density are considered.Based on the properties of the generalized geometric programming,the dual programs of these two problems are derived.Furthermore,the duality theorems and related Kuhn-Tucker conditions for two pairs of the prime-dual programs are also established by the duality theory. 展开更多
关键词 generalized geometric programming Kuhn-Tucker condition entropy of the density.
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部