{"title":"线性规划障碍对数方法中线搜索方法与主函数的数值比较研究","authors":"S. Chaghoub, D. Benterki","doi":"10.33993/jnaat491-1199","DOIUrl":null,"url":null,"abstract":"This paper presents a comparative numerical study between line search methods and majorant functions to compute the displacement step in barrier logarithmic method for linear programming. This study favorate majorant function on line search which is promoted by numerical experiments.","PeriodicalId":287022,"journal":{"name":"Journal of Numerical Analysis and Approximation Theory","volume":"104 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Comparative numerical study between line search methods and majorant functions in barrier logarithmic methods for linear programming\",\"authors\":\"S. Chaghoub, D. Benterki\",\"doi\":\"10.33993/jnaat491-1199\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a comparative numerical study between line search methods and majorant functions to compute the displacement step in barrier logarithmic method for linear programming. This study favorate majorant function on line search which is promoted by numerical experiments.\",\"PeriodicalId\":287022,\"journal\":{\"name\":\"Journal of Numerical Analysis and Approximation Theory\",\"volume\":\"104 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-09-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Numerical Analysis and Approximation Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.33993/jnaat491-1199\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Numerical Analysis and Approximation Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.33993/jnaat491-1199","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Comparative numerical study between line search methods and majorant functions in barrier logarithmic methods for linear programming
This paper presents a comparative numerical study between line search methods and majorant functions to compute the displacement step in barrier logarithmic method for linear programming. This study favorate majorant function on line search which is promoted by numerical experiments.