Proceedings of the 20th International Conference on Power Industry Computer Applications
DOI: 10.1109/pica.1997.599427
|View full text |Cite
|
Sign up to set email alerts
|

Consumer payment minimization in power pool auctions

Abstract: This paper presents a new methodology within the framework of centralized optimization for calculating optimal generation schedules that minimize energy payments by power pool consumers. This paper addresses issues related to market structure and the operation of power pools, such as bid evaluation, generator no-load and start-up cost recovery, generator unit operating constraints, and market clearing price determination. Unlike conventional Unit Commitment algorithms that minimize total energy production cost… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
48
0

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 34 publications
(48 citation statements)
references
References 9 publications
0
48
0
Order By: Relevance
“…The beginning part and the ending part can be represented by different slopes to relate the different rates of cost changes. Where Hi t = the total hours of service during period t. H t service = the total patient during period t. C S i,t = The start cast of service for I unit of patient in time t. Using optimization principle in two steps [7], the value of λ t which moves q (λ) towards a large Value and assuming the value of λ t as calculated as fixed, then the minimum of L is calculated by adjusting the values of H t and U t . In a regulated system, a central coordinator with all the cast curves of services F (Hi t , Ui t ) available performs the optimization represented in figure (1.2).…”
Section: 2: Existing Modeling Methodsmentioning
confidence: 99%
“…The beginning part and the ending part can be represented by different slopes to relate the different rates of cost changes. Where Hi t = the total hours of service during period t. H t service = the total patient during period t. C S i,t = The start cast of service for I unit of patient in time t. Using optimization principle in two steps [7], the value of λ t which moves q (λ) towards a large Value and assuming the value of λ t as calculated as fixed, then the minimum of L is calculated by adjusting the values of H t and U t . In a regulated system, a central coordinator with all the cast curves of services F (Hi t , Ui t ) available performs the optimization represented in figure (1.2).…”
Section: 2: Existing Modeling Methodsmentioning
confidence: 99%
“…7 By minimizing analytically [17, pp. 395-397], the relaxed problem is formed as (10) (11) The augmented Lagrangian is inseparable because of the cross product terms of MCP and and between elements of .…”
Section: A Augmented Lagrangianmentioning
confidence: 99%
“…While methods for minimizing offer costs abound, limited approaches have been reported for payment cost minimization. Most of the papers on payment cost minimization mathematically formulate the problem and use illustrative examples to demonstrate that it can reduce procurement costs but present no solution methodology [5], [7], [8], [11]. The only paper that presented a solution methodology was based on forward dynamic programming [10], but the author acknowledges that the method is not suited for large-scale problems because of the curse of dimensionality.…”
mentioning
confidence: 99%
“…Modeling and solving the bid selection process by the ISO has been discussed in [1], [2] and [3]. In [4], bids are selected to minimize total system costs while the Market Clearing Price (MCP) is determined as the price of the highest accepted bid. In [5], [7] and [8] a bidclearing system is presented.…”
mentioning
confidence: 99%