abstract:In mathematics, the linear programming relaxation of a 0-1 integer program is the problem that arises by replacing the constraint that each variable must be 0 or 1 by a weaker constraint, that each variable belong to the interval [0,1].
Based onthe dualrelaxationmethod, anextendedconvexprogrammingandsequentiallinearprogrammingoptimal power flowapproach is presented for online optimal dispatch.