Abstract | ||
---|---|---|
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. |
Year | DOI | Venue |
---|---|---|
1991 | 10.1287/moor.16.4.888 | Math. Oper. Res. |
Keywords | DocType | Volume |
geometric programming,information theoretic approach | Journal | 16 |
Issue | ISSN | Citations |
4 | 0364-765X | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
P. Brockett | 1 | 0 | 0.34 |
A. Charnes | 2 | 271 | 145.50 |