Primal partition programming for block diagonal matrices

DOI10.1007/BF01386073zbMath0129.34102MaRDI QIDQ2394962

J. Ben Rosen

Publication date: 1964

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131610

zbMATH Keywords

operations research

Related Items

Dynamic factorization in large-scale optimization, Decentralized control of large scale systems with dynamic interconnected subsystems, On solution of multicoupled models, A regularized decomposition method for minimizing a sum of polyhedral functions, A projective method for structured nonlinear programs, A partitioning algorithm for the multicommodity network flow problem, A dual decomposition method for block-diagonal linear programs, The basis suppression method, Unnamed Item, Unnamed Item, A quadratic programming algorithm, Optimality tests for partitioning and sectional search algorithms, Group preference modeling for intelligent shared environments: social welfare beyond the sum, Integer multicommodity flow problems, Über das Transportproblem mit beliebigen zusätzlichen linearen Nebenbedingungen, A decomposition method for structured quadratic programming problems, Generalized upper bounding techniques, Parallel solution of large-scale, block-angular linear programs, A decomposition method for structured linear and nonlinear programs, Beiträge zur Dekomposition von linearen Programmen

Cites Work

• Partitioning procedures for solving mixed-variables programming problems
• Decomposition Principle for Linear Programs
• Unnamed Item
• Unnamed Item
• Unnamed Item