A formulation of hybrid algorithm for linear programming

This paper introduces an effective hybridization of the usual simplex method and an interior point method in the convergent framework of Dembo and Sahi. It formulates a specific and detailed algorithm and reports the results of some preliminary testing on small dense problems for its viability. By piercing through the feasible region, the newly developed hybrid algorithm avoids the combinatorial structure of linear programs, and several other interesting and important characteristics of this algorithm are also discussed.