Pınar, AliÇatalyürek Ümit V.Aykanat, CevdetPınar, Mustafa2016-02-082016-02-081995-080302-9743http://hdl.handle.net/11693/27751Date of Conference: 21-24 August,1995Conference name: Second International Workshop on Applied Parallel Computing Computations in Physics, Chemistry and Engineering Science, PARA '95Coarse grain parallelism inherent in the solution of Linear Programming (LP) problems with block angular constraint matrices has been exploited in recent research works. However, these approaches suffer from unscalability and load imbalance since they exploit only the existing block angular structure of the LP constraint matrix. In this paper, we consider decomposing LP constraint matrices to obtain block angular structures with specified number of blocks for scalable parallelization. We propose hypergraph models to represent LP constraint matrices for decomposition. In these models, the decomposition problem reduces to the well-known hypergraph partitioning problem. A Kernighan-Lin based multiway hypergraph partitioning heuristic is implemented for experimenting with the performance of the proposed hypergraph models on the decomposition of the LP problems selected from NETLIB suite. Initial results are promising and justify further research on other hypergraph partitioning heuristics for decomposing large LP problems. © Springer-Verlag Berlin Heidelberg 1996.EnglishLinear programmingAngular constraintBlock-angular structureDecomposition problemsHypergraph partitioningNumber of blocksParallel solutionsParallelizationsRecent researchesMatrix algebraConference Paper10.1007/3-540-60902-4_50