Implicit representation of generalized variable upper bounds in linear programming
From MaRDI portal
Publication:4162962
DOI10.1007/BF01588948zbMath0383.90072MaRDI QIDQ4162962
Publication date: 1978
Published in: Mathematical Programming (Search for Journal in Brave)
Related Items (19)
Dynamic factorization in large-scale optimization ⋮ Exploiting special structure in Karmarkar's linear programming algorithm ⋮ Variations and extensions of Proll's integer linear programming formulation techniques for the graph partitioning problem ⋮ An Implementation of Variable Upper Bounds via SUB Methodology ⋮ An algorithm finding p-medians of a graph ⋮ Dual simplex algorithm with implicit representation of variable upper bounds ⋮ A dual approach for the continuous collapsing knapsack problem ⋮ Models for multimode multicommodity location problems with interdepot balancing requirements ⋮ Locational analysis ⋮ Compact LP bases for a class of IP problems ⋮ Implicit representation of generalized variable upper bounds using the elimination form of the inverse on secondary storage ⋮ Linear programming by nested decomposition : the primal decomplex method ⋮ Detecting embedded pure network structures in LP problems ⋮ A note on Schrage's generalised variable upper bounds ⋮ Identification of special structure constraints in linear programs ⋮ Large-scale linear programming: Geometry, working bases and factorizations ⋮ An implementation of the simplex method for linear programming problems with variable upper bounds ⋮ Bounded isotonic median regression ⋮ Solution techniques for some allocation problems
Cites Work
This page was built for publication: Implicit representation of generalized variable upper bounds in linear programming
