Publication:3929386

zbMath0474.90052MaRDI QIDQ3929386

Jan Telgen

Publication date: 1981

zbMATH Keywords

complexity; algorithms; simplex algorithm; redundancy; minimal representation

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

65K05: Numerical mathematical programming methods

90C05: Linear programming

65F10: Iterative numerical methods for linear systems

90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming

Related Items

Generalized theorems for permanent basic and nonbasic variables, The complexity of linear programming, Local tests for consistency of support hyperplane data., General criteria for redundant and nonredundant linear inequalities, A new family of exponential LP problems, Testing the definiteness of matrices on polyhedral cones, On linear inequality systems without strongly redundant constraints, On relaxation methods for systems of linear inequalities, Dynamic versions of set covering type public facility location problems, Weakly redundant constraints and their impact on postoptimal analyses in LP, A computational study of redundancy in randomly generated polytopes, A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs, Standard forms for rational linear arithmetic in constraint logic programming., Redundancy elimination with a lexicographic solved form, The isometries and the \(G\)-invariance of certain seminorms., Analysis of structure in fuzzy linear programs, A pathological case in the reduction of linear programs, Analytic centers and repelling inequalities, Redundancy in linear inequality system