✦ LIBER ✦

An algorithm for maximizing a convex function over a simple set

✍ Scribed by R. Enhbat

Publisher: Springer US
Year: 1996
Tongue: English
Weight: 456 KB
Volume: 8
Category: Article
ISSN: 0925-5001
DOI: 10.1007/bf02403999

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Algorithm for maximizing a linear functi

Algorithm for maximizing a linear function on the set of integral points of a convex polyhedron

✍ Nguen Ngok Tyu 📂 Article 📅 1987 🏛 Springer US 🌐 English ⚖ 491 KB

Method for minimizing a convex-concave f

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

✍ L. D. Muu; W. Oettli 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 358 KB

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

An Algorithm for Partitioning a Set into

An Algorithm for Partitioning a Set into Simple Parts

✍ L. Ya. Savel'ev 📂 Article 📅 2005 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 84 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