Finding all vertices of a convex polyhedron
From MaRDI portal
Publication:2530169
Cites work
- An Algorithm for Finding All Vertices of Convex Polyhedral Sets
- scientific article; zbMATH DE number 3148887 (Why is no real title available?)
- scientific article; zbMATH DE number 3167494 (Why is no real title available?)
- scientific article; zbMATH DE number 3078984 (Why is no real title available?)
- On the Number of Vertices of a Convex Polytope
- The Number of Vertices of a Polyhedron
Cited in
(37)- Pivoting rules and redundancy schemes in extreme point enumeration
- Polyhedral functions and multiparametric linear programming
- Enumerative technique for an extreme point fractional program
- An improved vertex enumeration algorithm
- Assessing a set of additive utility functions for multicriteria decision- making, the UTA method
- On computing the exact value of dispersion of a sequence
- Polytope pairs and their relationship to linear programming
- An algorithm for enumerating all vertices of a convex polyhedron
- Efficient enumeration of the vertices of polyhedra associated with network LP's
- Enumerating extreme points of a highly degenerate polytope
- A recursive algorithm for volume-based sensitivity analysis of linear decision models
- Optimization over the efficient set of a parametric multiple objective linear programming problem
- An algorithm for determining redundant inequalities and all solutions to convex polyhedra
- Segments in enumerating faces
- Binary choice models with discrete regressors: identification and misspecification
- Duality theorems for a class of nonconvex programming problems
- The multidimensional truncated moment problem: Gaussian mixture reconstruction from derivatives of moments
- Elicitation of criteria importance weights through the Simos method: a robustness concern
- Condiciones suficientes para la existencia de solucion optima en un programa semi-infinito
- A common formula to compute the efficient sets of a class of multiple objective linear programming problems
- Representacion finita de sistemas de infinitas inecuaciones
- scientific article; zbMATH DE number 3709929 (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
- Extreme point Quadratic Minimization Problem
- A Calculation of all Separating Hyperplanes of two Convex Polytopes
- On a calculation of an arbitrary separating hyperplane of convex polyhedral sets
- Separating support hyperplanes for a pair of convex polyhedral sets
- An interactive weight space reduction procedure for nonlinear multiple objective mathematical programming
- Eine Methode zur Berechnung des optimalen Produktionsprogramms bei konkaver Zielfunktion
- An extreme-point-ranking algorithm for the extreme-point mathematical programming problem
- On solving vague systems of linear equations with pattern-shaped columns
- Delaunay-based derivative-free optimization via global surrogates. I: Linear constraints
- Plausibility relations and multiple expected utilities in decision-making under uncertainty
- On the structure of the set bases of a degenerate point
- Unrestricted variables in linear programming
This page was built for publication: Finding all vertices of a convex polyhedron
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2530169)
