𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Simplicial Branch-and-Reduce Algorithm for Convex Programs with a Multiplicative Constraint

✍ Scribed by H. P. Benson

Publisher
Springer
Year
2009
Tongue
English
Weight
525 KB
Volume
145
Category
Article
ISSN
0022-3239

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

A Parallel Algorithm for Linear Programs
A Parallel Algorithm for Linear Programs with an Additional Reverse Convex Constraint
✍ Shih-Mim Liu; G.P. Papavassilopoulos πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 211 KB

A parallel method for globally minimizing a linear program with an additional reverse convex constraint is proposed which combines the outer approximation technique and the cutting plane method. Basically p (≀n) processors are used for a problem with n variables and a globally optimal solution is fo