𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A parallel algorithm for partially separable non-convex global minimization: Linear constraints

✍ Scribed by A. T. Phillips; J. B. Rosen

Book ID
112724133
Publisher
Springer US
Year
1990
Tongue
English
Weight
767 KB
Volume
25
Category
Article
ISSN
0254-5330

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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