Wide-Neighborhood Interior-Point Algorithm Based on Modified Newton Direction for Linear ProgrammingChinese Full Text
WANG Weiwei;LIU Hongwei;BI Hongmei;School of Mathematics and Statistics,Xidian University;School of Science,Xi’an Technological University;School of Science,Air Force Engineering University;
Abstract: Based on modifying the search direction of classic wide-neighborhood algorithm,a new wideneighborhood interior point algorithm for linear programming was proposed.The convergence analysis of the new algorithm was presented.And the algorithm enjoys the iteration bound O（nL）,the same as the complexity result for classic wide-neighborhood interior point method.The numerical calculation shows that the new algorithm is efficient.
Keywords：
linear programming; interior-point methods; wide-neighborhood algorithm; polynomial complexity;
- DOI：
10.13413/j.cnki.jdxblxb.2014.03.02
- Series：
- Subject：
- Classification Code：
O221.1
- Mobile Reading
Read on your phone instantly
Step 1Scan QR Codes
"Mobile CNKI-CNKI Express" App
Step 2Open“CNKI Express”
and click the scan icon in the upper left corner of the homepage.
Step 3
Scan QR Codes
Read this article on your phone.
- HTML
- CAJ Download
- PDF Download
Download the mobile appuse the app to scan this coderead the article.
Tips: Please download CAJViewer to view CAJ format full text.
Download: 67 Page: 408-412 Pagecount: 5 Size: 151K
Citation Network
Related Literature
- Similar Article
- Reader Recommendation
- Associated Author