Referenced Items are not available for this document.
An optimality condition theorem and an algorithm for nonlinear minimum-cost network flow are proposed. A computational network model for optimal daily scheduling of cascaded plants (ODSCP) is established, and an algorithm for searching the minimum-cost flow-augmenting path and the maximum-cost flow-reducing path in the computational network model of ODSCP is described. Digital computations are carried out and the results show that the proposed method is very fast compared to existing methods
Published in:
Power Systems, IEEE Transactions on
(Volume:3
,
Issue:
3
)
Date of Publication: Aug 1988
- Page(s):
- 929 - 935
- ISSN :
- 0885-8950
- INSPEC Accession Number:
- 3333921
- Digital Object Identifier :
- 10.1109/59.14543
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Aug 1988
- Sponsored by :
- IEEE Power & Energy Society
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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
