𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm for solving a convex programming problem with linear constraints

✍ Scribed by B. N. Pshenichnyi; I. F. Ganzhela


Publisher
Springer US
Year
1973
Tongue
English
Weight
384 KB
Volume
6
Category
Article
ISSN
1573-8337

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