𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Harold P. Benson; Reiner Horst

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
599 KB
Volume
21
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An algorithm for concave integer minimiz
An algorithm for concave integer minimization over a polyhedron
✍ Harold P. Benson; S. Selcuk Erenguc πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 753 KB

We present an algorithm for solving the problem of globally minimizing a concave function over the integers contained in a compact polyhedron. The objective function of this problem need not be separable or even analytically defined. To our knowledge, the algorithm is the first ever proposed for thi

A simplicial branch and duality bound al
A simplicial branch and duality bound algorithm for the sum of convex–convex ratios problem
✍ Pei-Ping Shen; Yun-Peng Duan; Yong-Gang Pei πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 601 KB

This article presents a simplicial branch and duality bound algorithm for globally solving the sum of convex-convex ratios problem with nonconvex feasible region. To our knowledge, little progress has been made for globally solving this problem so far. The algorithm uses a branch and bound scheme wh