File Download
There are no files associated with this item.
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Article: Pricing when market optimization has multiple dual solutions
Title | Pricing when market optimization has multiple dual solutions |
---|---|
Authors | |
Keywords | Clearing price Demand-side bidding Electricity market Optimization |
Issue Date | 2006 |
Citation | Dianli Xitong Zidonghua/Automation Of Electric Power Systems, 2006, v. 30 n. 12, p. 27-32 How to Cite? |
Abstract | A clearing price is directly obtained from the dual solution of market optimization in standard pricing. However, multiple dual solutions may exist in such a market optimization. Multiple clearing prices may thus occur. In this case, choosing a unique clearing price becomes a problem. On the other hand, market operation requires a proper clearing price. This paper first elucidates this problem in mathematical expression, then narrows down the interval of reasonable clearing price. Based on a social welfare analysis, a new method is proposed to set a clearing price. An example is described for testing the suggested pricing method. Discussion and conclusion are also provided. Results demonstrate that this method has sound basis and fast computation traits. |
Persistent Identifier | http://hdl.handle.net/10722/155335 |
ISSN | 2023 SCImago Journal Rankings: 1.171 |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Feng, D | en_HK |
dc.contributor.author | Gan, D | en_HK |
dc.contributor.author | Zhong, J | en_HK |
dc.contributor.author | Ni, Y | en_HK |
dc.date.accessioned | 2012-08-08T08:32:57Z | - |
dc.date.available | 2012-08-08T08:32:57Z | - |
dc.date.issued | 2006 | en_HK |
dc.identifier.citation | Dianli Xitong Zidonghua/Automation Of Electric Power Systems, 2006, v. 30 n. 12, p. 27-32 | en_HK |
dc.identifier.issn | 1000-1026 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/155335 | - |
dc.description.abstract | A clearing price is directly obtained from the dual solution of market optimization in standard pricing. However, multiple dual solutions may exist in such a market optimization. Multiple clearing prices may thus occur. In this case, choosing a unique clearing price becomes a problem. On the other hand, market operation requires a proper clearing price. This paper first elucidates this problem in mathematical expression, then narrows down the interval of reasonable clearing price. Based on a social welfare analysis, a new method is proposed to set a clearing price. An example is described for testing the suggested pricing method. Discussion and conclusion are also provided. Results demonstrate that this method has sound basis and fast computation traits. | en_HK |
dc.language | eng | en_US |
dc.relation.ispartof | Dianli Xitong Zidonghua/Automation of Electric Power Systems | en_HK |
dc.subject | Clearing price | en_HK |
dc.subject | Demand-side bidding | en_HK |
dc.subject | Electricity market | en_HK |
dc.subject | Optimization | en_HK |
dc.title | Pricing when market optimization has multiple dual solutions | en_HK |
dc.type | Article | en_HK |
dc.identifier.email | Zhong, J: jinzhong@hkucc.hku.hk | en_HK |
dc.identifier.email | Ni, Y: yxni@eee.hku.hk | en_HK |
dc.identifier.authority | Zhong, J=rp00212 | en_HK |
dc.identifier.authority | Ni, Y=rp00161 | en_HK |
dc.description.nature | link_to_subscribed_fulltext | en_US |
dc.identifier.scopus | eid_2-s2.0-33747078987 | en_HK |
dc.identifier.hkuros | 119123 | - |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-33747078987&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 30 | en_HK |
dc.identifier.issue | 12 | en_HK |
dc.identifier.spage | 27 | en_HK |
dc.identifier.epage | 32 | en_HK |
dc.publisher.place | China | en_HK |
dc.identifier.scopusauthorid | Feng, D=7401981343 | en_HK |
dc.identifier.scopusauthorid | Gan, D=7005499404 | en_HK |
dc.identifier.scopusauthorid | Zhong, J=13905948700 | en_HK |
dc.identifier.scopusauthorid | Ni, Y=7402910021 | en_HK |
dc.identifier.issnl | 1000-1026 | - |