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