.png){kind=icon}
Return
Feasible region contraction interior point algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2006.05.021.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we propose a new interior point algorithm for linear programming by combining the affine scaling algorithm and the primal path-following algorithm. We define a series of subproblems whose feasible region contracts toward the set of optimal solutions. In each iteration, we take a step in the steepest descent direction in a transformed space to reduce the objective value. Our preliminary computational results are very favorable. (c) 2006 Elsevier Inc. All rights reserved.
Keywords:
linear programming
interior point
affine scaling
path-following
feasible region contraction
barrier function
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
No organization information available
.png){kind=icon}
