A formalization of convex polyhedra based on the simplex method.

Xavier Allamigeon Ricardo D. Katz

Published in: CoRR (2017)

Keyphrases

simplex method
convex polyhedra
linear programming
linear program
linear fractional
convex hull
convergence rate
column generation
primal dual
minimum distance
interior point methods
gray scale
natural images
optimal solution
quadratic programming
policy iteration
supervised learning
np hard
support vector