|
|||||
|
|
A relaxed version of Karmarkar's method |
|
| Authors: | Donald Goldfarb Sanjay Mehrotra |
| Affiliation: | (1) Department of Industrial Engineering and Operations Research, Columbia University in the City of New York, 10027 New York, NY, USA;(2) Department of Industrial Engineering and Management Studies, Northwestern University, 2145 Sheriden Road, 60208 Evanston, IL, USA |
| Abstract: | A relaxed version of Karmarkar's method is developed. This method is proved to have the same polynomial time complexity as Karmarkar's method and its efficient implementation using inexact projections is discussed. Computational results obtained using a preliminary implementation of the method are presented which indicate that the method is practicable.This research was supported in part by NSF Grants CDR 84-21402 and DMS-85-12277 and ONR Contract N00014-87-K-0214. |
| Keywords: | Linear programming Karmarkar's method inexact projections |
| 本文献已被 SpringerLink 等数据库收录！ | |