| dc.contributor.advisor | Grace, Donald W. | |
| dc.contributor.author | Kim, Byeong-Soo | |
| dc.date.accessioned | 2015-08-28T15:49:34Z | |
| dc.date.available | 2015-08-28T15:49:34Z | |
| dc.date.issued | 1987-05-01 | |
| dc.identifier.uri | https://hdl.handle.net/11244/17004 | |
| dc.description.abstract | The Karmarkar algorithm and its modifications are studied in this thesis. A modified line search algorithm with extended searching bound to the facet of the simplex is developed and implemented. Using this modification, a modified row partition method is tested. Both algorithms are coded in Fortran 77 and compared their performances with the original Karmarkar algorithm. The modifications are promising and other extensions are encouraged. | |
| dc.format | application/pdf | |
| dc.language | en_US | |
| dc.publisher | Oklahoma State University | |
| dc.rights | Copyright is held by the author who has granted the Oklahoma State University Library the non-exclusive right to share this material in its institutional repository. Contact Digital Library Services at lib-dls@okstate.edu or 405-744-9161 for the permission policy on the use, reproduction or distribution of this material. | |
| dc.title | Some Modifications and Extensions of Karmarkar's Main Algorithm with Computational Experiences | |
| dc.type | text | |
| dc.contributor.committeeMember | Chandler, J. P. | |
| dc.contributor.committeeMember | Hedrick, G. E. | |
| osu.filename | Thesis-1987-K49s.pdf | |
| osu.accesstype | Open Access | |
| dc.description.department | Computing and Information Science | |
| dc.type.genre | Thesis | |
