摘要

Unit commitment problem is one of large-scale nonlinear and mixed integer programming for zero-one variable. In the power market, it is more difficult due to the subsection characteristic of the unit bidding curves. There are a penalty function and a SQP method to solve last integer programming for zero-one variables and nonlinear programming for continue variables after treating with every unit power to more add, taking aim to the subsection characteristic of unit bidding curves. It has been tested on a simple testing system and gives good results.