Dynamic factorization in large-scale optimization

DOI10.1007/BF01582564zbMath0803.90085OpenAlexW2010864359MaRDI QIDQ1330893

Gerald G. Brown, Michael P. Olson

Publication date: 10 August 1994

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01582564

zbMATH Keywords

generalized networksgeneralized upper boundsdynamic row factorizationfactorization of linear programmingpure networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Linear programming (90C05)

Related Items (5)

A strategic model for supply chain design with logical constraints: Formulation and solution. ⋮ Valid integer polytope (VIP) penalties for branch-and-bound enumeration ⋮ A specialized network simplex algorithm for the constrained maximum flow problem ⋮ Optimizing ship berthing ⋮ Strategic production-distribution models: A critical review with emphasis on global supply chain models

Uses Software

• CPLEX
• MINOS
• OSL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving embedded generalized network problems
• Partitioning procedures for solving mixed-variables programming problems
• Solving singularly constrained generalized network problems
• Primal partition programming for block diagonal matrices
• Generalized upper bounding techniques
• Solving Generalized Networks
• Decomposition Principle for Linear Programs
• Automatic identification of embedded network rows in large-scale optimization models
• Large-scale linear programming: Geometry, working bases and factorizations
• Extracting embedded generalized networks from linear programming problems
• A Primal Simplex Approach to Pure Processing Networks
• Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics
• A bump triangular dynamic factorization algorithm for the simplex method
• Automatic Identification of Generalized Upper Bounds in Large-Scale Optimization Models
• Identification of special structure constraints in linear programs
• The simplex SON algorithm for LP/embedded network problems
• Determining GUB sets via an invert agenda algorithm
• Multicommodity Distribution System Design by Benders Decomposition
• Solving Constrained Transportation Problems
• Analysis of mathematical programming problems prior to applying the simplex algorithm
• The factorization approach to large-scale linear programming
• A primal algorithm for solving a capacitated network flow problem with additional linear constraints
• A product form representation of the inverse of a multicommodity cycle matrix
• Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
• Solving multicommodity transportation problems using a primal partitioning simplex technique
• A Survey of Linear Cost Multicommodity Network Flows
• Multicommodity network flows—A survey
• Implicit representation of generalized variable upper bounds in linear programming
• A streamlined simplex approach to the singly constrained transportation problem
• A complete constructive algorithm for the general mixed linear programming problem
• Reinversion with the preassigned pivot procedure
• A generalized upper bounding method for doubly coupled linear programs
• A generalized upper bounding algorithm for multicommodity network flow problems

This page was built for publication: Dynamic factorization in large-scale optimization