Off-campus WSU users: To download campus access dissertations, please use the following link to log into our proxy server with your WSU access ID and password, then click the "Off-campus Download" button below.
Non-WSU users: Please talk to your librarian about requesting this thesis through interlibrary loan.
Access Type
WSU Access
Date of Award
January 2023
Degree Type
Thesis
Degree Name
M.S.
Department
Mathematics
First Advisor
Boris Mordukhovich
Second Advisor
Kazuhiko Shinki
Abstract
This thesis is centered around the non-simplex methods of solving Linear Programming problems. The main attention of thesis is paid to the celebrated Karmarkar’s method of linear programming. Besides a comprehensive review of the various aspects of Karmarkar’s method and related development of Interior-Point methods of optimization, MATLAB programs written and implemented to solve particular linear programming problems. We start this by creat Affine’s function code and use it to create Karmarkar’s function code. We conclude that Khachiyan inspired Karmarkar to creat his method of solving linear programming problems and Karmarkar’s method has a great role in developing methods for solving linear programming problems, specially the Interior-Point methods.
Recommended Citation
Shaji, Huda Saleh, "Non-Simplex Method In Linear Programming" (2023). Wayne State University Theses. 904.
https://digitalcommons.wayne.edu/oa_theses/904