EXTENDED BINARY SEARCH AND ITS APPLCATION IN DESIGN OF POLYNOMIAL-TIME ALGORITHM FOR LP
广义二分搜索及其在 LP 多项式算法复杂度证明中的应用

This paper presents an unified methodology for design of polynomial-time algorithms forLP by summarizing Khachiyan's algorithm and Karmarkar's algorithm.The authors deve-loped the concepts of binary search are developel into the so-called extended binary search,whi-ch is used as an unified model to analyze the complexities of algorthms and to help designnew algorithms.