{"title":"欧洲电力交易所最低收入条件订单的清算算法","authors":"Á. Sleisz, D. Raisz","doi":"10.1109/RTUCON.2014.6998204","DOIUrl":null,"url":null,"abstract":"State-of-the-art power exchange designs have to take a large set of economic and technical constraints into consideration. A specific difficulty is that most power generators have non-convex characteristics, for example startup costs and minimal load during operation. Minimum income condition orders constitute a method to represent some of the power plants' corresponding economic interests on energy markets, e.g. on the proposed all-European day-ahead power exchange. However, the non-convexity of these offers can be computationally expensive. A new clearing algorithm is proposed to manage the issue effectively with advanced mathematical tools.","PeriodicalId":259790,"journal":{"name":"2014 55th International Scientific Conference on Power and Electrical Engineering of Riga Technical University (RTUCON)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Clearing algorithm for minimum income condition orders on European power exchanges\",\"authors\":\"Á. Sleisz, D. Raisz\",\"doi\":\"10.1109/RTUCON.2014.6998204\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"State-of-the-art power exchange designs have to take a large set of economic and technical constraints into consideration. A specific difficulty is that most power generators have non-convex characteristics, for example startup costs and minimal load during operation. Minimum income condition orders constitute a method to represent some of the power plants' corresponding economic interests on energy markets, e.g. on the proposed all-European day-ahead power exchange. However, the non-convexity of these offers can be computationally expensive. A new clearing algorithm is proposed to manage the issue effectively with advanced mathematical tools.\",\"PeriodicalId\":259790,\"journal\":{\"name\":\"2014 55th International Scientific Conference on Power and Electrical Engineering of Riga Technical University (RTUCON)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 55th International Scientific Conference on Power and Electrical Engineering of Riga Technical University (RTUCON)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RTUCON.2014.6998204\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 55th International Scientific Conference on Power and Electrical Engineering of Riga Technical University (RTUCON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RTUCON.2014.6998204","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Clearing algorithm for minimum income condition orders on European power exchanges
State-of-the-art power exchange designs have to take a large set of economic and technical constraints into consideration. A specific difficulty is that most power generators have non-convex characteristics, for example startup costs and minimal load during operation. Minimum income condition orders constitute a method to represent some of the power plants' corresponding economic interests on energy markets, e.g. on the proposed all-European day-ahead power exchange. However, the non-convexity of these offers can be computationally expensive. A new clearing algorithm is proposed to manage the issue effectively with advanced mathematical tools.