Simple Search

Query:

Enter a query and click »Search«...

Format:

Display: entries per page entries

Zbl 0531.90066
Dutta, Amitava; Siegel, Howard J.; Whinston, Andrew B.
On the application of parallel architectures to a class of operations research problems. (English)
[J] RAIRO, Rech. Opér. 17, 317-341 (1983). ISSN 0399-0559

Matrix operations of LP-programs (on the basis of the simplex method) are solved on a multiprocessor computer, here on an SIMD machine. There is good reason for developing this method, for there is quite a number of LP-programs where the decomposition principle can be applied: e.g. all those where sub-departments try to optimize a part of the objective function independently. The time gain is (depending on the problem and its size) one order of magnitude with small problems, two and more with large ones. Needless to say, the parallelity here is a centrally clocked one and not a concurrent one.
[H.Fuss]

MSC 2000:: *90C06 Large-scale problems
65K05 Mathematical programming (numerical methods)
90C05 Linear programming
68N99 Software
94C99 Circuits, networks
68U99 Computing methodologies

Keywords: decomposition algorithms; interconnection network; clocked parallel processing; SIMD machines; Matrix operations of LP-programs; simplex method

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Simple Search

Zentralblatt MATH Berlin [Germany]