An Algorithm for Finding All Vertices of Convex Polyhedral Sets

Cited in

(58)

Pivoting rules and redundancy schemes in extreme point enumeration
Enumerative techniques for solving some nonconvex global optimization problems
Linear programming with uncertain objective function: Minimax solution for relative loss
Linear programs with an additional reverse convex constraint
Designing two factor experiments for selecting interactions
A method for approximating the solution set of a system of convex inequalities by polytopes
Generalized bilinear programming. I: Models, applications and linear programming relaxation
On computing the exact value of dispersion of a sequence
Quasi-concave minimization subject to linear constraints
Uniqueness of equilibrium points in bimatrix games
Equilibrium points in special n-person games
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
Enumerating extreme points of a highly degenerate polytope
A general algorithm for determining all essential solutions and inequalities for any convex polyhedron
Markov games with incomplete information
On the achievement stability set for parametric linear goal programming problems
Stability set for integer linear goal programming
An algorithm for determining redundant inequalities and all solutions to convex polyhedra
Segments in enumerating faces
Stability on multiobjective linear programming problems with fuzzy parameters
The Stackelberg equilibrium for one-sided zero-sum partially observable stochastic games
Binary choice models with discrete regressors: identification and misspecification
On stability of proper efficient solutions in multiobjective fractional programming problems under fuzziness
Stability of vector optimization problems with fuzzy weights in the objective functions and fuzzy matrix parameters in the constraints
Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron.
Finding all vertices of a convex polyhedron
An iterative goal programming approach for solving fuzzy multiobjective integer linear programming problems
The multidimensional truncated moment problem: Gaussian mixture reconstruction from derivatives of moments
Hit-and-run algorithms for the identification of nonredundant linear inequalities
A common formula to compute the efficient sets of a class of multiple objective linear programming problems
On stationary equilibria of a single-controller stochastic game
scientific article; zbMATH DE number 3709929 (Why is no real title available?)
scientific article; zbMATH DE number 3793302 (Why is no real title available?)
A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron
An algorithm for determining all extreme points of a convex polytope
Least distance methods for the scheme of polytopes
An Algorithm for solving the Integer Linear Fractional Programs
Bicriterion integer linear fractional programs with parameters in the objective functions
A linear max—min problem
scientific article; zbMATH DE number 3446688 (Why is no real title available?)
Farkas certificates and minimal witnesses for probabilistic reachability constraints
On minimal generators for semi-closed polyhedra
An interactive weight space reduction procedure for nonlinear multiple objective mathematical programming
Identifying redundant linear constraints in systems of linear matrix inequality constraints
Generation of all integer points for given sets of linear inequalities
The complexity of linear programming
Generating all vertices of a polyhedron is hard
Stability of linear vector optimization problems corresponding to an efficient set
A comparative study of redundant constraints identification methods in linear programming problems
An efficient algorithm for vertex enumeration of arrangement
Delaunay-based derivative-free optimization via global surrogates. I: Linear constraints
On the structure of the set bases of a degenerate point
Interactive approach to bi-level integer multi-objective fractional programming problem
Jointly constrained bilinear programs and related problems: An overview

This page was built for publication: An Algorithm for Finding All Vertices of Convex Polyhedral Sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3844778)