Cart (Loading....) | Create Account
Close category search window
 

A mixed integer programming solution for market clearing and reliability analysis

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Streiffert, D. ; AREVA T&D Corp., Bellevue, WA, USA ; Philbrick, R. ; Ott, A.

This paper presents a description of a mixed integer programming (MIP) solution for solving the PJM unit commitment problem. Included is a description of the day-ahead market clearing problem and the reliability analysis problem. This is followed by an overview of the MIP development process and some selected comparisons with our previously existing Lagrangian relaxation (LR) algorithm. The paper describes many of the inherent problems associated with MIP solutions and illustrates how these issues were dealt with to provide a fast, accurate, and robust MIP solution.

Published in:

Power Engineering Society General Meeting, 2005. IEEE

Date of Conference:

12-16 June 2005

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.