Identification of special structure constraints in linear programs

DOI10.1007/BF01584231zbMath0467.90045MaRDI QIDQ3920989

Stephen Hoff, Linus Schrage, Gamini Gunawardane

Publication date: 1981

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

incidence matrixnetwork constraintsidentification algorithmgeneralized upper boundsgeneralized network constraintsgeneralized variable upper boundsLeontieff constraintsmin-spike algorithmsspecial structure constraintstriangular constraints

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06)

Related Items (7)

Dynamic factorization in large-scale optimization ⋮ Variations and extensions of Proll's integer linear programming formulation techniques for the graph partitioning problem ⋮ An outer-approximation algorithm for a class of mixed-integer nonlinear programs ⋮ Use of hidden network structure in the set partitioning problem ⋮ Dynamic versions of set covering type public facility location problems ⋮ Detecting embedded pure network structures in LP problems ⋮ The practical conversion of linear programmes to network flow models

Cites Work

• Unnamed Item
• Unnamed Item
• Decomposition Principle for Linear Programs
• Determining GUB sets via an invert agenda algorithm
• The Solution of Leontief Substitution Systems using Matrix Iterative Techniques
• Implicit representation of generalized variable upper bounds in linear programming
• Elements of Large-Scale Mathematical Programming Part I: Concepts
• Rearranging Matrices to Block-Angular form for Decomposition (And Other) Algorithms
• Optimization of the flow through networks with gains
• Reinversion with the preassigned pivot procedure

This page was built for publication: Identification of special structure constraints in linear programs