Scheduling of power generation via large-scale nonlinear optimization (Q1821695): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: ALGOL 60 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4101610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5685869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5564917 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Function minimization by conjugate gradients / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf00939088 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2000550574 / rank
 
Normal rank

Latest revision as of 10:35, 30 July 2024

scientific article
Language Label Description Also known as
English
Scheduling of power generation via large-scale nonlinear optimization
scientific article

    Statements

    Scheduling of power generation via large-scale nonlinear optimization (English)
    0 references
    1987
    0 references
    We investigate methods for solving high-dimensional nonlinear optimization problems which typically occur in the daily scheduling of electricity production: problems with a nonlinear, separable cost function, lower and upper bounds on the variables, and an equality constraint to satisfy the demand. If the cost function is quadratic, we use a modified Lagrange multiplier technique. For a nonquadratic cost function (a penalty function combining the original cost function and certain fuel constraints, so that it is generally not separable), we compare the performance of the gradient-projection method and the reduced-gradient method, both with conjugate search directions within facets of the feasible set. Numerical examples at the end of the paper demonstrate the effectiveness of the gradient-projection method to solve problems with hundreds of variables by exploitation of the special structure.
    0 references
    high-dimensional nonlinear optimization
    0 references
    daily scheduling
    0 references
    electricity production
    0 references
    separable cost function
    0 references
    modified Lagrange multiplier technique
    0 references
    nonquadratic cost function
    0 references
    gradient-projection method
    0 references
    reduced-gradient method
    0 references
    conjugate search directions
    0 references
    dispatch problems
    0 references
    continuous knapsack problems
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references