๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Decomposition in a non-linear programming problem with a non-convex constraint

โœ Scribed by A.I. Kosolap


Publisher
Elsevier Science
Year
1984
Weight
316 KB
Volume
24
Category
Article
ISSN
0041-5553

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A Parallel Algorithm for Linear Programs
โœ 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