An improving procedure of the interior projective method for linear programming

作者:

Highlights:

摘要

We propose in this study, a practical modification of Karmarkar’s projective algorithm for linear programming problems. This modification leads to a considerable reduction of the cost and the number of iterations.This claim is confirmed by many interesting numerical experimentations.

论文关键词:Linear programming,Interior point methods,Karmarkar’s algorithm,Ye–Lustig algorithm

论文评审过程:Available online 17 October 2007.

论文官网地址:https://doi.org/10.1016/j.amc.2007.10.014