ON AN EFFICIENT IMPLEMENTATION OF THE FACE ALGORITHM FOR LINEAR PROGRAMMING
Zhang Leihong (longzlhgmail.com)
Abstract: In this paper, we consider the solution of the standard linear programming (LP). A remarkable result in LP claims that all optimal solutions form an optimal face of the underlying polyhedron. In practice, many real-world problems have infinitely many optimal solutions and pursuing the optimal face, not just an optimal vertex, is quite desirable. The face algorithm proposed  targets at the optimal face by iterating from face to face, along an orthogonal projection of the negative objective gradient onto a relevant null space. The algorithm exhibits a favorable numerical performance by comparing the simplex method. In this paper, we further investigate the face algorithm by proposing an improved implementation. In exact arithmetic computation, the new algorithm generates the same sequence as the original face algorithm, but uses less computational costs per iteration, and enjoys favorable properties for sparse problems.
Keywords: Linear programming, Level face, Optimal face, Rank-one correction
Category 1: Linear, Cone and Semidefinite Programming (Linear Programming )
Citation: Journal of Computational Mathematics, to appear.
Entry Submitted: 04/19/2012
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|