An Algorithm for Finding All Vertices of Convex Polyhedral Sets
From MaRDI portal
Publication:3844778
DOI10.1137/0109008zbMath0108.33203OpenAlexW2071094669WikidataQ60174234 ScholiaQ60174234MaRDI QIDQ3844778
Publication date: 1961
Published in: Journal of the Society for Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0109008
Related Items
The Stackelberg equilibrium for one-sided zero-sum partially observable stochastic games, Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints, A general algorithm for determining all essential solutions and inequalities for any convex polyhedron, An Algorithm for solving the Integer Linear Fractional Programs, A common formula to compute the efficient sets of a class of multiple objective linear programming problems, Enumerative techniques for solving some nonconvex global optimization problems, Segments in enumerating faces, Markov games with incomplete information, Stability on multiobjective linear programming problems with fuzzy parameters, The multidimensional truncated moment problem: Gaussian mixture reconstruction from derivatives of moments, On the achievement stability set for parametric linear goal programming problems, Linear programming with uncertain objective function: Minimax solution for relative loss, Linear programs with an additional reverse convex constraint, A comparative study of redundant constraints identification methods in linear programming problems, Designing two factor experiments for selecting interactions, Unnamed Item, Interactive approach to bi-level integer multi-objective fractional programming problem, Generation of all integer points for given sets of linear inequalities, A tree traversal algorithm for decision problems in knot theory and 3-manifold topology, Jointly constrained bilinear programs and related problems: An overview, Binary choice models with discrete regressors: identification and misspecification, Unnamed Item, A method for approximating the solution set of a system of convex inequalities by polytopes, On stability of proper efficient solutions in multiobjective fractional programming problems under fuzziness, Generalized bilinear programming. I: Models, applications and linear programming relaxation, On computing the exact value of dispersion of a sequence, Stability of vector optimization problems with fuzzy weights in the objective functions and fuzzy matrix parameters in the constraints, Hit-and-run algorithms for the identification of nonredundant linear inequalities, An interactive weight space reduction procedure for nonlinear multiple objective mathematical programming, The complexity of linear programming, Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron., Bicriterion integer linear fractional programs with parameters in the objective functions, Unnamed Item, Quasi-concave minimization subject to linear constraints, A linear max—min problem, A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron, Stability of linear vector optimization problems corresponding to an efficient set, An algorithm for determining all extreme points of a convex polytope, Identifying redundant linear constraints in systems of linear matrix inequality constraints, Delaunay-based derivative-free optimization via global surrogates. I: Linear constraints, Uniqueness of equilibrium points in bimatrix games, Equilibrium points in special n-person games, Finding all vertices of a convex polyhedron, Generating all vertices of a polyhedron is hard, Least distance methods for the scheme of polytopes, Stability set for integer linear goal programming, On minimal generators for semi-closed polyhedra, An iterative goal programming approach for solving fuzzy multiobjective integer linear programming problems, An algorithm for determining redundant inequalities and all solutions to convex polyhedra, On the structure of the set bases of a degenerate point, Pivoting rules and redundancy schemes in extreme point enumeration, Selected bibliography on degeneracy, 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, On stationary equilibria of a single-controller stochastic game, Enumerating extreme points of a highly degenerate polytope
