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.