| Article ID: | iaor19921129 |
| Country: | United States |
| Volume: | 16 |
| Issue: | 4 |
| Start Page Number: | 888 |
| End Page Number: | 889 |
| Publication Date: | Nov 1991 |
| Journal: | Mathematics of Operations Research |
| Authors: | Charnes A., Brockett P. |
| Keywords: | information theory |
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.