An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities
From MaRDI portal
Publication:5681800
DOI10.1287/opre.21.1.247zbMath0265.90024OpenAlexW2011562113MaRDI QIDQ5681800
Publication date: 1973
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.21.1.247
Related Items
A branch and bound algorithm for extreme point mathematical programming problems, Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints, Nonquadratic Lyapunov functions for robust control, A common formula to compute the efficient sets of a class of multiple objective linear programming problems, Markov games with incomplete information, Random Procedures for Nonredundant Constraint Identification in Stochastic Linear Programs, A heuristic algorithm for resource allocation/reallocation problem, A comparative study of redundant constraints identification methods in linear programming problems, Unnamed Item, Zur Identifikation redundanter Nebenbedingungen in linearen Programmen, Minimal representation of convex polyhedral sets, An improved vertex enumeration algorithm, A Calculation of all Separating Hyperplanes of two Convex Polytopes, An analytical expression and an algorithm for the volume of a convex polyhedron in \(R^ n\)., Binary choice models with discrete regressors: identification and misspecification, (Deterministic) algorithms that compute the volume of polytopes, A new pivoting rule for solving various degeneracy problems, Hit-and-run algorithms for the identification of nonredundant linear inequalities, The complexity of linear programming, Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron., On a calculation of an arbitrary separating hyperplane of convex polyhedral sets, Separating support hyperplanes for a pair of convex polyhedral sets, Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints, Polytope pairs and their relationship to linear programming, A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron, Analytic bounds on causal risk differences in directed acyclic graphs involving three observed binary variables, An extreme-point-ranking algorithm for the extreme-point mathematical programming problem, An algorithm for determining all extreme points of a convex polytope, Computational results on an algorithm for finding all vertices of a polytope, Finding and identifying optimal inventory levels for systems with common components, Generating all vertices of a polyhedron is hard, Least distance methods for the scheme of polytopes, An algorithm for determining redundant inequalities and all solutions to convex polyhedra, Adaptive receding horizon control for constrained MIMO systems, A heuristic approach for identification of redundant constraints in linear programming models, Pivoting rules and redundancy schemes in extreme point enumeration, Degeneracy graphs: Theory and applications. An updated survey, Bounds on the number of vertices of perturbed polyhedra, An improved \(N\)-tree algorithm for the enumeration of all neighbors of a degenerate vertex, Efficient enumeration of the vertices of polyhedra associated with network LP's, Enumerating extreme points of a highly degenerate polytope
