An algorithm for determining all extreme points of a convex polytope
From MaRDI portal
Publication:4159164
Cites work
- A Node Method for Multiparametric Linear Programming
- Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities
- An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities
- An algorithm for determining redundant inequalities and all solutions to convex polyhedra
- An Algorithm for Finding All Vertices of Convex Polyhedral Sets
- Extreme Point Mathematical Programming
- Finding all vertices of a convex polyhedron
- scientific article; zbMATH DE number 3159208 (Why is no real title available?)
- scientific article; zbMATH DE number 3167494 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- scientific article; zbMATH DE number 3375237 (Why is no real title available?)
- scientific article; zbMATH DE number 3078984 (Why is no real title available?)
- scientific article; zbMATH DE number 3080072 (Why is no real title available?)
- Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
- Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points
- Solving the Fixed Charge Problem by Ranking the Extreme Points
- Technical Note—Vertex Generation and Cardinality Constrained Linear Programs
Cited in
(39)- On degeneracy in enumeration
- Pivoting rules and redundancy schemes in extreme point enumeration
- Evolution, games theory and polyhedra
- Enumerative techniques for solving some nonconvex global optimization problems
- Linear programs with an additional reverse convex constraint
- An improved vertex enumeration algorithm
- On the duality of a non-convex optimization problem and the strong unicity constant in linear Chebyshev approximation
- A new pivoting rule for solving various degeneracy problems
- Selected bibliography on degeneracy
- Degeneracy graphs: Theory and applications. An updated survey
- 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
- Practical issues on the projection of polyhedral sets
- Restricting weights in value efficiency analysis.
- Errors bounds for finite approximations of coherent lower previsions on finite probability spaces
- Linearly constrained global optimization: a general solution algorithm with applications.
- Segments in enumerating faces
- Directional differentiability of optimal solutions under Slater's condition
- Sufficient optimality criterion for linearly constrained, separable concave minimization problems
- Linear optimization with fuzzy variable over fuzzy polytope
- An interactive polyhedral approach for multi-objective combinatorial optimization with incomplete preference information
- A common formula to compute the efficient sets of a class of multiple objective linear programming problems
- A validation and verification tool for global optimization solvers
- A simple algorithm for the-linear bilevel programming problem
- On the calculation of a membership function for the solution of a fuzzy linear optimization problem
- 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
- The generalized jacobian of the optimal solution in parametric optimization
- Farkas certificates and minimal witnesses for probabilistic reachability constraints
- Fourier algorithm revisited
- Enumerating vertices of 0/1-polyhedra associated with 0/1-totally unimodular matrices
- Enumerating vertices of covering polyhedra with totally unimodular constraint matrices
- Generating all vertices of a polyhedron is hard
- An efficient algorithm for vertex enumeration of arrangement
- Identifiability and exact reconstruction of the optimal transport cost on finite spaces
- On the use of cuts in reverse convex programs
This page was built for publication: An algorithm for determining all extreme points of a convex polytope
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4159164)
