𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Restricted simplicial decomposition for convex constrained problems

✍ Scribed by Jose A. Ventura; Donald W. Hearn

Book ID
105249079
Publisher
Springer-Verlag
Year
1993
Tongue
English
Weight
831 KB
Volume
59
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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