Open-Source Software for Power Industry Research, Teaching, and Training: A DC Optimal Power Flow Illustration
Software currently available for power industry studies is largely proprietary. Lack of open-source access prevents users from gaining a complete and accurate understanding of what has been implemented, restricts the ability of users to experiment with new software features, and hinders users from tailoring software to specific training scenarios. This study reports on the development of a stand-alone open-source Java solver for DC optimal power flow (DC-OPF) problems suitable for research, teaching, and training purposes. The DC-OPF solver is shown to match or exceed the accuracy of BPMPD, a proprietary third-party QP solver highly recommended by MatPower, when tested on a public repository of small to medium-sized QP problems. The capabilities of the DC-OPF solver are illustrated for a 5-node DC-OPF test case commonly used for training purposes. Related work can be accessed at: http://www2.econ.iastate.edu/tesfatsi/AMESMarketHome.htm
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||01 Jan 2007|
|Contact details of provider:|| Postal: Iowa State University, Dept. of Economics, 260 Heady Hall, Ames, IA 50011-1070|
Phone: +1 515.294.6741
Fax: +1 515.294.0221
Web page: http://www.econ.iastate.edu
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:isu:genres:12775. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Curtis Balmer)
If references are entirely missing, you can add them using this form.