Reducing Linear Programs into Min-max Problems
We show how to reduce a general, strictly-feasible LP problem, into a min-max problem, which can be solved by the algorithm from the third section of my thesis.
cs.CG↗
arXiv subjects
Carmi Grushko
Publications and source records attributed to Carmi Grushko.
A Hough Transform Approach to Solving Linear Min-Max Problems
Several ways to accelerate the solution of 2D/3D linear min-max problems in $n$ constraints are discussed. We also present an algorithm for solving such problems in the 2D case, which is superior to CGAL's linear programming solver, both in performance and in stability.
math.NA↗