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