JavaScript is disabled for your browser. Some features of this site may not work without it.
Polynomiality of the Kojima-Megiddo-Mizuno Infeasible Interior Point Algorithm for Linear Programming

Author
Mizuno, S.
Abstract
Polynomiality of the Kojima-Megiddo-Mizuno Infeasible Interior Point Algorithm for Linear Programming
Date Issued
1992-05Publisher
Cornell University Operations Research and Industrial Engineering
Subject
Operations Research; Industrial Engineering; technical report
Previously Published As
1006
Type
technical report