Interior-point linear programming algorithm for auction methods

摘要

Interior-point programming (IP) has been applied to many power system problems because of its efficiency for big problems. This paper illustrates application of interior-point linear programming (IPLP) to auction methods. An extended algorithm of IPLP is developed and used in this paper. This extended IPLP algorithm can find the exact optimal solution (i.e., exact optimal vertex) and can recover the optimal basis. Sensitivity analysis can be performed after the optimal basis is found. The sensitivity analysis performed in this paper is increase in the bid price and increase in the flow limit of the transmission line. This extended algorithm is expanded from the affine-scaling primal algorithm. The concept used in this extended algorithm to find the optimal vertex and optimal basis is simple.