Please use this identifier to cite or link to this item:
http://acervodigital.unesp.br/handle/11449/71794
- Title:
- Optimal contract pricing of distributed generation under a competitive framework
- Universidad de Antioquia
- Universidade Estadual Paulista (UNESP)
- E.T.S. de Ingenieros Industriales
- A bilevel programming approach for the optimal contract pricing of distributed generation (DG) in distribution networks is presented. The outer optimization problem corresponds to the owner of the DG who must decide the contract price that would maximize his profits. The inner optimization problem corresponds to the distribution company (DisCo), which procures the minimization of the payments incurred in attending the expected demand while satisfying network constraints. The meet the expected demand the DisCo can purchase energy either form the transmission network through the substations or form the DG units within its network. The inner optimization problem is substituted by its Karush- Kuhn-Tucker optimality conditions, turning the bilevel programming problem into an equivalent single-level nonlinear programming problem which is solved using commercially available software. © 2010 IEEE.
- 26-Jul-2010
- 2010 IEEE PES Transmission and Distribution Conference and Exposition: Smart Solutions for a Changing World.
- Bilevel programming
- Distributed generation
- Bi-level programming
- Bilevel programming problem
- Contract prices
- DG unit
- Distributed Generation
- Distributed generations
- Distribution companies
- Distribution network
- Karush kuhn tuckers
- Network constraints
- Nonlinear programming problem
- Optimal contract
- Optimality conditions
- Optimization problems
- Transmission networks
- Distributed parameter networks
- Galerkin methods
- Nonlinear programming
- Profitability
- Optimization
- http://dx.doi.org/10.1109/TDC.2010.5484456
- Acesso restrito
- outro
- http://repositorio.unesp.br/handle/11449/71794
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.