✦ LIBER ✦

Logarithmic convexity and geometric programming

✍ Scribed by Allen Klinger; O.L Mangasarian

Book ID: 103190823
Publisher: Elsevier Science
Year: 1968
Tongue: English
Weight: 858 KB
Volume: 24
Category: Article
ISSN: 0022-247X
DOI: 10.1016/0022-247x(68)90039-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Logarithmic SUMT limits in convex progra

Logarithmic SUMT limits in convex programming

✍ Garth P. McCormick; Christoph Witzgall 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 224 KB

Conjugate duality for convex programs: A

Conjugate duality for convex programs: A geometric development

✍ Arthur F. Veinott Jr. 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 226 KB

Geometric plurisubharmonicity and convex

Geometric plurisubharmonicity and convexity: An introduction

✍ F. Reese Harvey; H. Blaine Lawson Jr. 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 305 KB

Geometric Programming

✍ Duffin, R. J.; Peterson, E. L.; Zener, C. M. 📂 Article 📅 1974 🏛 Institute of Electrical and Electronics Engineers ⚖ 227 KB

Solution to geometric programming proble

Solution to geometric programming problems by transformation to convex programming problems

✍ G.S. Dawkins; B.C. McInnis; S.K. Moonat 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 144 KB

Logarithmic Convexity and Inequalities f

Logarithmic Convexity and Inequalities for the Gamma Function

✍ Milan Merkle 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 132 KB

We propose a method, based on logarithmic convexity, for producing sharp Ž . Ž . bounds for the ratio ⌫ x q ␤ r⌫ x . As an application, we present an inequality that sharpens and generalizes inequalities due to Gautschi, Chu, Boyd, Lazarevic-Ĺupas ¸, and Kershaw.