A Parallel Algorithm for Linear Programs with an Additional Reverse Convex Constraint

Liu, S; Papavassilopoulos, G

dc.contributor.author	Liu, S	en
dc.contributor.author	Papavassilopoulos, G	en
dc.date.accessioned	2014-03-01T01:45:30Z
dc.date.available	2014-03-01T01:45:30Z
dc.date.issued	1997	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/24599
dc.subject	Cutting Plane Method	en
dc.subject	Distributed Memory	en
dc.subject	Global Optimization	en
dc.subject	Linear Constraint	en
dc.subject	Parallel Algorithm	en
dc.subject	Linear Program	en
dc.title	A Parallel Algorithm for Linear Programs with an Additional Reverse Convex Constraint	en
heal.type	journalArticle	en
heal.identifier.primary	10.1006/jpdc.1997.1366	en
heal.identifier.secondary	http://dx.doi.org/10.1006/jpdc.1997.1366	en
heal.publicationDate	1997	en
heal.abstract	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 prob- lem with n variables and a globally optimal solution is found effectively in a finite number of steps. Computational results are presented for	en
heal.journalName	Journal of Parallel and Distributed Computing	en
dc.identifier.doi	10.1006/jpdc.1997.1366	en