{"title":"改进Karmarker算法求最优解","authors":"Ahmad Khaldi","doi":"10.54216/gjmsa.030204","DOIUrl":null,"url":null,"abstract":"In this research, the Karmarker's method of linear programming was improved using the eigenvector of the starting point with all iterations.Where the improvement showed that Karmarker's method can be reduced in a theoretical way by direct method without iterations and access to the optimal solution. The procedure was also Comparison of the two methods and the results of the proposed method were faster and better to reach.","PeriodicalId":299243,"journal":{"name":"Galoitica: Journal of Mathematical Structures and Applications","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Improving Karmarker Algorithm to Obtain Optimal Solution\",\"authors\":\"Ahmad Khaldi\",\"doi\":\"10.54216/gjmsa.030204\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this research, the Karmarker's method of linear programming was improved using the eigenvector of the starting point with all iterations.Where the improvement showed that Karmarker's method can be reduced in a theoretical way by direct method without iterations and access to the optimal solution. The procedure was also Comparison of the two methods and the results of the proposed method were faster and better to reach.\",\"PeriodicalId\":299243,\"journal\":{\"name\":\"Galoitica: Journal of Mathematical Structures and Applications\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Galoitica: Journal of Mathematical Structures and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.54216/gjmsa.030204\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Galoitica: Journal of Mathematical Structures and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.54216/gjmsa.030204","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Improving Karmarker Algorithm to Obtain Optimal Solution
In this research, the Karmarker's method of linear programming was improved using the eigenvector of the starting point with all iterations.Where the improvement showed that Karmarker's method can be reduced in a theoretical way by direct method without iterations and access to the optimal solution. The procedure was also Comparison of the two methods and the results of the proposed method were faster and better to reach.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
