✦ LIBER ✦

Method for minimizing a convex-concave function over a convex set

✍ Scribed by L. D. Muu; W. Oettli

Publisher: Springer
Year: 1991
Tongue: English
Weight: 358 KB
Volume: 70
Category: Article
ISSN: 0022-3239
DOI: 10.1007/bf00940633

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A method for globally minimizing concave

A method for globally minimizing concave functions over convex sets

✍ Karla Leigh Hoffman 📂 Article 📅 1981 🏛 Springer-Verlag 🌐 English ⚖ 491 KB

Concave minimization over a convex polyh

Concave minimization over a convex polyhedron

✍ Hamdy A. Taha 📂 Article 📅 1973 🏛 John Wiley and Sons 🌐 English ⚖ 781 KB

A branch and bound-outer approximation a

A branch and bound-outer approximation algorithm for concave minimization over a convex set

✍ Harold P. Benson; Reiner Horst 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 599 KB

Minimizing a quasi-concave function subj

Minimizing a quasi-concave function subject to a reverse convex constraint

✍ L. V. Dien 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 429 KB

An outer approximation method for minimi

An outer approximation method for minimizing the product of several convex functions on a convex set

✍ Takahito Kuno; Yasutoshi Yajima; Hiroshi Konno 📂 Article 📅 1993 🏛 Springer US 🌐 English ⚖ 458 KB

Maximizing the ratio of two convex funct

Maximizing the ratio of two convex functions over a convex set

✍ Harold P. Benson 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB

## Abstract The purpose of this article is to present an algorithm for globally maximizing the ratio of two convex functions __f__ and __g__ over a convex set __X__. To our knowledge, this is the first algorithm to be proposed for globally solving this problem. The algorithm uses a branch and bound