scientific article
From MaRDI portal
Publication:3929386
zbMath0474.90052MaRDI QIDQ3929386
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Linear programming (90C05) Iterative numerical methods for linear systems (65F10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
General criteria for redundant and nonredundant linear inequalities, A new family of exponential LP problems, Standard forms for rational linear arithmetic in constraint logic programming., Testing the definiteness of matrices on polyhedral cones, Redundancy elimination with a lexicographic solved form, On linear inequality systems without strongly redundant constraints, The isometries and the \(G\)-invariance of certain seminorms., 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, Local tests for consistency of support hyperplane data., A computational study of redundancy in randomly generated polytopes, The complexity of linear programming, Generalized theorems for permanent basic and nonbasic variables, A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs, Analysis of structure in fuzzy linear programs, Redundancy in linear inequality system, A pathological case in the reduction of linear programs, Analytic centers and repelling inequalities
