Beiträge zur Dekomposition von linearen Programmen

DOI10.1007/BF01920940zbMath0144.42709MaRDI QIDQ5521241

No author found.

Publication date: 1966

Published in: Unternehmensforschung Operations Research - Recherche Opérationnelle (Search for Journal in Brave)

zbMATH Keywords

operations research

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partitioning procedures for solving mixed-variables programming problems
• Primal partition programming for block diagonal matrices
• A method for piecewise solution of a structured linear program
• On the Status of Multistage Linear Programming Problems
• A Suggested Computation for Maximal Multi-Commodity Network Flows
• Solution of Nonlinear Programming Problems by Partitioning
• Optimal Solution of a Dynamic Leontief Model with Substitution
• Decomposition Principle for Linear Programs
• The Decomposition Algorithm for Linear Programs
• A Treatment of Transportation Problems by Decomposition
• An Application of Generalized Linear Programming to Network Flows
• New Methods in Mathematical Programming—Some Simplex-Like Nonlinear Programming Procedures
• Linear Programming in a Markov Chain
• Two-Level Planning
• On direct sums and tensor products of non-linear programs
• A Stochastic Transportation Problem
• Special Simplex Algorithm for Linked Problems
• Decomposition of linear programs by dynamic programming
• Experiences in Using a Decomposition Program
• A Nonlinear Decomposition Principle
• Synthesis of a Communication Network
• On an Approach to Techniques for the Analysis of the Structure of Large Systems of Equations
• On direct sums and tensor products of linear programs
• Upper Bounds, Secondary Constraints, and Block Triangularity in Linear Programming