Finding all vertices of a convex polyhedron
From MaRDI portal
Publication:2530169
DOI10.1007/BF02162916zbMath0165.51801MaRDI QIDQ2530169
Publication date: 1968
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131868
Related Items
Polyhedral functions and multiparametric linear programming, Extreme point Quadratic Minimization Problem, A common formula to compute the efficient sets of a class of multiple objective linear programming problems, Elicitation of criteria importance weights through the Simos method: a robustness concern, Segments in enumerating faces, A recursive algorithm for volume-based sensitivity analysis of linear decision models, Eine Methode zur Berechnung des optimalen Produktionsprogramms bei konkaver Zielfunktion, The multidimensional truncated moment problem: Gaussian mixture reconstruction from derivatives of moments, Enumerative technique for an extreme point fractional program, Unnamed Item, An improved vertex enumeration algorithm, Unrestricted variables in linear programming, A Calculation of all Separating Hyperplanes of two Convex Polytopes, Assessing a set of additive utility functions for multicriteria decision- making, the UTA method, Binary choice models with discrete regressors: identification and misspecification, On computing the exact value of dispersion of a sequence, On solving vague systems of linear equations with pattern-shaped columns, An interactive weight space reduction procedure for nonlinear multiple objective mathematical programming, On a calculation of an arbitrary separating hyperplane of convex polyhedral sets, Separating support hyperplanes for a pair of convex polyhedral sets, Polytope pairs and their relationship to linear programming, A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron, An algorithm for enumerating all vertices of a convex polyhedron, An extreme-point-ranking algorithm for the extreme-point mathematical programming problem, An algorithm for determining all extreme points of a convex polytope, Delaunay-based derivative-free optimization via global surrogates. I: Linear constraints, Condiciones suficientes para la existencia de solucion optima en un programa semi-infinito, Least distance methods for the scheme of polytopes, Duality theorems for a class of nonconvex programming problems, Optimization over the efficient set of a parametric multiple objective linear programming problem, Representacion finita de sistemas de infinitas inecuaciones, Plausibility relations and multiple expected utilities in decision-making under uncertainty, 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, Efficient enumeration of the vertices of polyhedra associated with network LP's, Enumerating extreme points of a highly degenerate polytope
Cites Work
