Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Load balancing in the parallel optimization of block-angular linear programs (1993)
    Springer
    Mathematical programming 62 (1993), S. 41-67 
    Details
    ISSN: 1436-4646
    Keywords: Linear programming ; Dantzig—Wolfe decomposition ; large-scale systems ; parallel processing ; hypercube architecture
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Decomposition algorithms for block-angular linear programs give rise to a natural, coarse-grained parallelism that can be exploited by processing the subproblems concurrently within a distributed-memory environment. The parallel efficiency of the distributed approach, however, is critically dependent on the duration of the inherently serial master phase relative to that of the bottleneck subproblem. This paper investigates strategies for improving efficiency in distributed Dantzig—Wolfe decomposition by better balancing the load between the master and subproblem processors. We report computational experience on an Intel iPSC/2 hypercube multiprocessor with test problems having dimensions up to about 30 000 rows, 87 000 columns, and 200 coupling constraints.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01585159
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Decomposition of linear programs using parallel computation (1988)
    Springer
    Mathematical programming 42 (1988), S. 391-405 
    Details
    ISSN: 1436-4646
    Keywords: Linear programming ; large-scale-systems ; decomposition ; parallel computing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper describes DECOMPAR: an implementation of the Dantzig-Wolfe decomposition algorithm for block-angular linear programs using parallel processing of the subproblems. The software is based on a robust experimental code for LP decomposition and runs on the CRYSTAL multicomputer at the University of Wisconsin-Madison. Initial computational experience is reported. Promising directions in future development of this approach are discussed.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01589413
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    On the efficacy of distributed simplex algorithms for linear programming (1994)
    Springer
    Computational optimization and applications 3 (1994), S. 349-363 
    Details
    ISSN: 1573-2894
    Keywords: Linear programming ; distributed computation ; multiprocessing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We consider the use of distributed computation to solve general unstructured linear programs by the inherently serial approach of the simplex method. Timing models for the distributed algorithms are presented to predict results which are then verified empirically. Our results contribute to the identification of all viable exploitations of distributed computing which is likely to become a prevalent environment.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01299209
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...