Pages that link to "Item:Q5681800"

The following pages link to An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities (Q5681800):

Displaying 41 items.

• A heuristic algorithm for resource allocation/reallocation problem (Q410767) (← links)
• An extreme-point-ranking algorithm for the extreme-point mathematical programming problem (Q580171) (← links)
• A comparative study of redundant constraints identification methods in linear programming problems (Q624719) (← links)
• Pivoting rules and redundancy schemes in extreme point enumeration (Q1063390) (← links)
• A branch and bound algorithm for extreme point mathematical programming problems (Q1078072) (← links)
• Minimal representation of convex polyhedral sets (Q1158127) (← links)
• An improved vertex enumeration algorithm (Q1160560) (← links)
• An analytical expression and an algorithm for the volume of a convex polyhedron in \(R^ n\). (Q1165469) (← links)
• A new pivoting rule for solving various degeneracy problems (Q1198621) (← links)
• Polytope pairs and their relationship to linear programming (Q1218333) (← links)
• Degeneracy graphs: Theory and applications. An updated survey (Q1312751) (← links)
• Bounds on the number of vertices of perturbed polyhedra (Q1312764) (← links)
• An improved \(N\)-tree algorithm for the enumeration of all neighbors of a degenerate vertex (Q1312773) (← links)
• Efficient enumeration of the vertices of polyhedra associated with network LP's (Q1315430) (← links)
• Enumerating extreme points of a highly degenerate polytope (Q1318458) (← links)
• Markov games with incomplete information (Q1374696) (← links)
• An algorithm for determining redundant inequalities and all solutions to convex polyhedra (Q1846732) (← links)
• Nonquadratic Lyapunov functions for robust control (Q1893001) (← links)
• Analytic bounds on causal risk differences in directed acyclic graphs involving three observed binary variables (Q2272102) (← links)
• Adaptive receding horizon control for constrained MIMO systems (Q2342424) (← links)
• Binary choice models with discrete regressors: identification and misspecification (Q2448407) (← links)
• Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron. (Q2482881) (← links)
• Finding and identifying optimal inventory levels for systems with common components (Q2519082) (← links)
• Hit-and-run algorithms for the identification of nonredundant linear inequalities (Q3026740) (← links)
• Random Procedures for Nonredundant Constraint Identification in Stochastic Linear Programs (Q3217951) (← links)
• A heuristic approach for identification of redundant constraints in linear programming models (Q3437363) (← links)
• A common formula to compute the efficient sets of a class of multiple objective linear programming problems (Q3454856) (← links)
• Computational results on an algorithm for finding all vertices of a polytope (Q3872190) (← links)
• (Q3901298) (← links)
• Zur Identifikation redundanter Nebenbedingungen in linearen Programmen (Q4048846) (← links)
• A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron (Q4136974) (← links)
• An algorithm for determining all extreme points of a convex polytope (Q4159164) (← links)
• Least distance methods for the scheme of polytopes (Q4192906) (← links)
• A Calculation of all Separating Hyperplanes of two Convex Polytopes (Q4342958) (← links)
• (Deterministic) algorithms that compute the volume of polytopes (Q4360038) (← links)
• On a calculation of an arbitrary separating hyperplane of convex polyhedral sets (Q4397408) (← links)
• Separating support hyperplanes for a pair of convex polyhedral sets (Q4397409) (← links)
• Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints (Q5039515) (← links)
• Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints (Q5175471) (← links)
• The complexity of linear programming (Q5904560) (← links)
• Generating all vertices of a polyhedron is hard (Q5920505) (← links)