.png){kind=icon}
.png){kind=icon}
Return
Interior point algorithm for linear programming used in transmission network synthesis
.png){kind=icon}
PRE
AI
DOI：10.1016/j.epsr.2005.02.007.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This article presents a well-known interior point method (IPM) used to solve problems of linear programming that appear as sub-problems in the solution of the long-term transmission network expansion planning problem. The linear programming problem appears when the transportation model is used, and when there is the intention to solve the planning problem using a constructive heuristic algorithm (CHA), ora branch-and-bound algorithm. This paper shows the application of the IPM in a CHA. A good performance of the IPM was obtained, and then it can be used as tool inside algorithm, used to solve the planning problem. Illustrative tests are shown, using electrical systems known in the specialized literature. (C) 2005 Elsevier B.V. All rights reserved.
Keywords:
transmission network synthesis
interior point method
relaxed optimization models
network expansion planning
transportation model
constructive heuristic algorithms
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.2
Papers:
1.1W
Citations:
2.2W
Organization
No organization information available