An Algorithm for Finding All Vertices of Convex Polyhedral Sets

Cited in

(58)

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

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)