SEMIDEFINITE PROGRAMMING RELAXATION OF A CLASS OF ENERGY MANAGEMENT MODELS
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
N/A
Issued Date -
N/A
app pub date -
Jan 15, 2014
filing date -
Jan 16, 2013
priority date (Note) -
Abandoned
status (Latency Note)
Importance
Abstract
According to an aspect of the invention, there is provided a method for optimizing a cost of electric power generation in a smart site energy management model, including determining a matrix X that minimizes a semidefinite program C·X−μ ln(det(X)) subject to constraints ABL(X)=bBL, AEG(X)=bEG, AIF(X)=bIF, X0, for positive real values of μ as μ approaches zero, wherein C·X is a cost function that models a smart building-grid energy, where C is a parameter matrix, X is a decision variable matrix, ABL(X), AEG(X), and AIF(X) are sparse constraint matrices, bBL, bEG, and bIF are constants derived from the constraints, and exploiting the sparsity of matrices ABL(X), AEG(X), and AIF(X) in determining a search direction for determining the vector X.
First Claim
Family
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully