NDLI: Payment cost minimization with transmission capacity constraints and losses using the objective switching method

Content Provider	IEEE Xplore Digital Library
Author	Xu Han Luh, P.B. Yan, J.H. Stern, G.A.
Copyright Year	2010
Description	Author affiliation: Market Strategy and Resource Planning, Southern California Edison, Rosemead, CA 91770 USA (Yan, J.H.; Stern, G.A.) \|\| Department of Electrical and Computer Engineering, University of Connecticut, Storrs, 06269-2157, USA (Xu Han; Luh, P.B.)
Abstract	Deregulated electricity markets in the U.S. currently minimize total bid costs to select bids and their generation levels but determine payments based on market clearing prices. The inconsistency between auction and settlement mechanisms can lead to a significantly higher consumer payment. This gives rise to the “payment cost minimization,” an alternative auction mechanism that minimizes consumer payments directly. This paper formulates payment cost minimization problems with transmission capacity constraints and losses. DC power flow is used to model the transmitted power. The locational marginal prices are defined by “economic dispatch” and characterized by using the Karush-Kuhn-Tucker conditions. The formulation is converted to linear to be solved by the branch-and-cut method in standard commercial solver CPLEX's MIP. Specific methods for the linear conversion are highlighted. The efficiency for solving this linear payment cost minimization model in CPLEX's MIP is still low. The difficulties are studied by comparing the convex hulls of the two auction problems. To overcome the difficulties and improve the efficiency, the new “objective switching method” is developed which can be also used for solving other NP hard problems. Performance cuts are first generated to reduce the feasible region. The infeasibilities of originally discrete variables are then minimized within the reduced region to find one of many feasible near-optimal solutions with quantifiable quality. Numerical testing results of small examples and IEEE Reliability Test System demonstrate the effectiveness and efficiency of the model and the method.
Starting Page	1
Ending Page	8
File Size	614544
Page Count	8
File Format	PDF
ISBN	9781424465491
ISSN	19449925
e-ISBN	9781424465514
e-ISBN	9781424483570
DOI	10.1109/PES.2010.5589532
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2010-07-25
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Minimization Economics Equations Mathematical model Biological system modeling Load flow Linear programming payment cost minimization Branch-and-cut method CPLEX deregulated power markets MIP objective switching
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Energy and spinning reserve payment cost co-optimization

Payment Cost Minimization Auction for Deregulated Electricity Markets With Transmission Capacity Constraints

Payment minimization auction for deregulated electricity markets considering transmission capacity constraints

Efficient surrogate optimization for payment cost co-optimization with transmission capacity constraints

Payment cost minimization auction for deregulated electricity markets with transmission capacity constraints (2008).

Solving payment cost co-optimization problems

Power flow based allocation procedures for voltage security and transmission losses in deregulated power markets

Optimal power flow in deregulated electricity markets

An LP-based optimal power flow for transmission losses and generator reactive margins minimization

Payment cost minimization with transmission capacity constraints and losses using the objective switching method

Similar Documents

Energy and spinning reserve payment cost co-optimization

Payment Cost Minimization Auction for Deregulated Electricity Markets With Transmission Capacity Constraints

Payment minimization auction for deregulated electricity markets considering transmission capacity constraints

Efficient surrogate optimization for payment cost co-optimization with transmission capacity constraints

Payment cost minimization auction for deregulated electricity markets with transmission capacity constraints (2008).

Solving payment cost co-optimization problems

Power flow based allocation procedures for voltage security and transmission losses in deregulated power markets

Optimal power flow in deregulated electricity markets

An LP-based optimal power flow for transmission losses and generator reactive margins minimization

Payment cost minimization with transmission capacity constraints and losses using the objective switching method