Abstract

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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.