Author image not provided
 Koonchan Kim

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article1.00
Citation Count2
Publication count2
Publication years1991-1994
Available for download1
Average downloads per article229.00
Downloads (cumulative)229
Downloads (12 Months)6
Downloads (6 Weeks)1
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


2 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 2 of 2
Sort by:

1 published by ACM
September 1994 ACM Transactions on Mathematical Software (TOMS): Volume 20 Issue 3, Sept. 1994
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 1,   Downloads (12 Months): 6,   Downloads (Overall): 229

Full text available: PDFPDF
This article develops an affine-scaling method for linear programming in standard primal form. Its descent search directions are formulated in terms of the null-space of the linear programming matrix, which, in turn, is defined by a suitable basis matrix. We describe some basic properties of the method and an experimental ...
Keywords: diagonal preconditioning, interior-point algorithm, conjugate gradients, primal method, null-space affine scaling

2
January 1991
Bibliometrics:
Citation Count: 1

One of the most widely used methods for solving linear programs is the simplex method developed by Dantzig in 1947. The new interior-point method (projective method) pioneered by Karmarkar in 1984 and its variants have been the subject of active research and have shown encouraging results. The primary concern in ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us