Linear Optimization by Conical Projection

Abstract: This article focuses on numerical efficiency of projection algorithms for solving linear optimization problems. The theoretical foundation for this approach is provided by the basic result that bounded finite dimensional linear optimization problem can be solved by single projection operation on the feasible polyhedron. The further simplification transforms this problem into projection of a special point onto a convex polyhedral cone generated basically by inequalities of the original linear optimization problem.