INFORMATION THEORETIC APPROACH TO GEOMETRIC-PROGRAMMING

被引：0
作者：
BROCKETT, P
CHARNES, A
机构：
来源：
MATHEMATICS OF OPERATIONS RESEARCH | 1991年 / 16卷 / 04期
关键词：
GEOMETRIC PROGRAMMING; INFORMATION THEORY; GEOMETRIC INEQUALITIES; DUALITY;
D O I：
10.1287/moor.16.4.888
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
This paper shows how the fundamental geometric inequality lemma of geometric programming can be obtained immediately from information theoretic methods. This results in a drastic simplification of the proof and points the way to other connections between information theory and geometric programming.
引用
收藏
页码：888 / 889
页数：2
相关论文
共 6 条
  • [1] MDI ESTIMATION VIA UNCONSTRAINED CONVEX-PROGRAMMING
    BROCKETT, PL
    CHARNES, A
    COOPER, WW
    [J]. COMMUNICATIONS IN STATISTICS PART B-SIMULATION AND COMPUTATION, 1980, 9 (03): : 223 - 234
  • [2] Charnes A., 1978, Mathematische Operationsforschung und Statistik, Series Optimization, V9, P21, DOI 10.1080/02331937808842461
  • [3] CHARNES A, 1974, RENDICONTI ACCADEMIA, P556
  • [4] CHARNES A, 1974, REND ACCAD NAZ LIN 8, P56
  • [5] Duffin R.J., 1967, GEOMETRIC PROGRAMMIN
  • [6] KULLBACK S, 1959, INFORMATION THEORY S
1