O(n\({}^ pL)\)-iteration and \(O(n^ 3L)\)-operation potential reduction algorithms for linear programming (Q805163): Difference between revisions

Two kinds of O(n\({}^ 3L)\)-operation algorithms are proposed. These algorithms generalize those proposed by \textit{Y. Ye} [An \(O(n^ 3L)\) potential reduction algorithm for linear programming, Math. Programm., Ser. A 50, No.2, 239-258 (1991)] and by \textit{K. M. Anstreicher} and \textit{R. A. Bosch} [Long steps in a \(O(n^ 3L)\) algorithm for linear programming. Yale School of Management, New Haven, Conn. (1989)] in two ways. One is the generalization of the potential function by a parameter on which the search direction also depends. The other is the generalization of the step size in primal space also by a parameter.