As a natural extension of Roos and Vialu27s "Long steps with logarithmic penalty barrier function in llnear programming" (1989) and Yeu27s "An O(n³L) potential reduction algorithm for linear programming" (1989), it will be shown that the classical logarithmic barrier function method can be adjusted so that it generates the optimal solution in O(√nL) iterations, where n is the number of variables and L is the data length.
展开▼
