AN IMPROVEMENT ON UNCONSTRAINED CONVEX PROGRAMMING APPROACH TO LINEAR PROGRAMMING

摘要

For satate form linear gram as Fang and sao deined and approach which would find an optimal solution by solving an anconstrained convex dual programming.Thedual was construcied by applying an emropic peturbation and a simple Inequality Inzz-1 for z0n,In this paper,we suggest than a paperbation functiontake the place of Inx such that the new approdt has good numerical stability andhas all properties of the original