# Patent

## Title
Optimized security constrained unit commitment dispatch using linear programming for electricity markets

## Abstract

The present invention is a method for optimizing security constrained unit commitment in the day ahead wholesale electricity market using mixed integer linear programming techniques. The wholesale electricity market uniquely requires the submission of offers to supply energy and ancillary services at stated prices, as well as bids to purchase energy, and known operating and security constraints. The present invention address the above noted needs by providing a SCUC engine to support and implement the requirements via a computer system implementation.

## Background
CROSS-REFERENCE TO RELATED APPLICATIONS
This application is a continuation-in-part of U.S. patent application Ser. No. 10/385,011 filed on Mar. 10, 2003, which is herein incorporated by reference.


TECHNICAL FIELD
This invention relates generally to the optimization management of wholesale electricity markets. In particular, the invention pertains to the optimization of security constrained unit commitment in regional wholesale day ahead energy markets.
BACKGROUND ART
This invention relates generally to a method of determining the optimal commitments of energy and ancillary services for wholesale energy market clearing and pricing. In particular, the invention pertains to the optimal selection of offers submitted by market participants to satisfy energy and ancillary service requirements for regional electricity markets while satisfying operating and security constraints. It may be used by electricity market operators such as Regional Transmission Organizations, Independent System Operators, and Independent Transmission Providers. It may also be used by market participants as a tool to study various possible bidding strategies and to simulate possible market results.
A brief description of how electricity markets function under the Federal Energy Regulatory Commission (“FERC”) regulations may be helpful in understanding the field of the present invention. In April 1996, FERC Order 888, “Promoting Wholesale Competition Through Open Access Nondiscriminatory Transmission Services by Public Utilities,” required jurisdictional public utilities to file open access transmission tariffs to allow competition in the supply of wholesale electrical energy. Under the Order 888 market entities (utilities, merchant generators, energy traders, etc) compete to provide energy based on several factors including cost and availability of transfer capacity on transmission facilities. Market entities can be limited from providing energy to certain regions based on the availability of transfer capacity on transmission facilities. This order had the effect of introducing competition by allowing access to the transmission system to allow transportation of electricity from buyer to seller.
A next stage in the development of electricity markets was the FERC Order 2000, “Regional Transmission Organizations,” issued in December 1999. This order required jurisdictional public utilities to form and participate in a Regional Transmission Organization (“RTO”). The operational control of generators, and transmission facilities was assigned to the Regional Transmission Organization. Under FERC regulations, RTOs are required, among other things; to ensure that its transmission customers have access to an ancillary services and real time balancing market. An RTO may cover parts of one or more states within the United States. RTOs are required to maintain efficient traffic grid management, to improve grid reliability, to monitor and mitigate against opportunities for discriminatory transmission practices, and to improve competition in the wholesale electricity markets. The RTO is expected to administer the open access transmission tariff, to exercise operational control over congestion management, reliability and to plan the expansion of its transmission system. An additional set of requirements for RTOs are that they remain independent of the market participants.
FERC also authorized the startup of several regional electricity markets, including the PJM, ISO NE, NYISO, and the CAISO. These markets had different rules including those that govern a wholesale spot market for electrical energy. The operators of these markets are faced with the need to select offers provided by market participants that satisfy requirements and operating constraints.
The next stage in the development of electricity markets is the July 2002, FERC Notice of Proposed Rulemaking (NOPR), “Remedying Undue Discrimination through Open Access Transmission Service and Standard Electricity Market Design.” This NOPR announces FERC's intent to form a standard market design for wholesale electrical energy that would apply to all jurisdictional utilities This NOPR requires public utilities to place their transmission assets that are used in interstate commerce under the control of an Independent Transmission Provider or ITP. Among other functions, an ITP is responsible for operating a day ahead market and a real time market for electrical energy and ancillary services.
In the day ahead market for electricity, spot market prices are generally determined based on offers to supply energy and on forecast requirements for load. One possible solution is to determine a supply curve using either marginal costs or bid prices to rank order the plants beginning with the cheapest plants. Bids are selected starting with the cheapest and ascending until requirements are satisfied. However, it is necessary to consider operational constraints, which leads to selection of bids out of merit order. Heuristic methods are used to determine which bid to select out-of-order. There are, however, better possible approaches that are based on optimization. Additionally, the FERC NOPR recognizes that to create a truly competitive wholesale power market, the market must also allow for price responsive loads.
In this framework, the market operator receives pricing information from various wholesale market generators (typically coal-fired power plants, hydroelectric power plants, nuclear power plants, etc.) and receives energy requirements information from the Load Serving Entities The market operator is then responsible for determining an operating plan based on the offers provided by the various market generators and the bids provided by the various Load Serving Entities in the most cost effective manner.
Optimization tools are necessary to determine market clearing and commodity pricing based on submitted offers, while meeting operating and security constraints. This invention addresses the needs of a market operator by allowing the modeling of the technical characteristics of the offers as well as the transmission operating and security constraints. Offers include the supply of ancillary services by means of generating units and as well as price sensitive loads. The invention allows the selection of the optimal choice among the offered products based on selected criteria such as minimizing the payments made by the market operator to the market suppliers. The present invention address the above noted needs by facilitating an efficient day ahead clearance and pricing mechanism for complex co-optimized solutions for trading of energy and ancillary services.
SUMMARY OF THE INVENTION
According to one aspect of the invention, there is provided a system for optimizing the selection of offers submitted to the market operator by market participants such that all requirements for energy and ancillary services are satisfied along with operating and security constraints. The problem is formulated as a mixed integer linear program. Offers are formulated as piecewise linear functions. Operating constraints are formulated as linear inequalities. Commitment or selection decisions are formulated as integer variables. The results of this problem are the market clearing prices for each offered commodity and the amounts of products to be awarded to each market participant.



BRIEF DESCRIPTION OF THE FIGURES
The present invention will now be described with reference to the accompanying drawings wherein:
FIG. 1 is a schematic diagram of the system in accordance with the principles of the present invention.



DETAILED DESCRIPTION OF THE FIGURES
To illustrate the principles of the present invention, a Security Constrained Unit Commitment (SCUC) co-optimization engine as developed by Siemens Power Transmission & Distribution, Inc., the assignee of the present invention, shall be described in detail. While this SCUC co-optimization engine constitutes a preferred embodiment of the invention, it is not the intention of applicants to limit the scope of the invention to the particular details of this engine. Rather, it is the intention of the applicants that the invention be defined by the appended claims and all equivalents thereto.
Referring to FIG. 1, there is shown an exemplary block diagram of the components and interfaces of an SCUC co-optimization engine 100 in accordance with the principles of the present invention. The SCUC co-optimization engine 100 consists generally of a Market User Interface 102, a Load Forecast engine 104, a component for handling and archiving market data (HIS) 106, SCUC 108, a component for market commodity pricing (Pricing Engine) 110, and a Market Database 114. A Mixed Integer Linear Programming engine is also included as an optimization tool (MILP), 118.
The objective of the day ahead security constrained unit commitment problem is defined as a minimization of the sum of the total market costs. This can be mathematically formulated as:




  
    
      ∑
      
        t
        =
        1
      
      T
    
    ⁢
    
      {
      
        
          ∑
          
            i
            =
            1
          
          N
        
        ⁢
        
          [
          
            
              
                
                  c
                  start
                
                ⁡
                
                  (
                  
                    i
                    ,
                    t
                  
                  )
                
              
              ·
              
                Z
                ⁡
                
                  (
                  
                    i
                    ,
                    t
                  
                  )
                
              
            
            +
            
              
                
                  c
                  nold
                
                ⁡
                
                  (
                  
                    i
                    ,
                    t
                  
                  )
                
              
              ·
              
                Y
                ⁡
                
                  (
                  
                    i
                    ,
                    t
                  
                  )
                
              
            
            +
            
              
                c
                en
              
              ⁡
              
                (
                
                  i
                  ,
                  t
                
                )
              
            
            +
            
              
                c
                reg
              
              ⁡
              
                (
                
                  i
                  ,
                  t
                
                )
              
            
            +
            
              
                ∑
                
                  j
                  ∈
                  
                    com
                    ′
                  
                
              
              ⁢
              
                
                  c
                  j
                
                ⁡
                
                  (
                  
                    i
                    ,
                    t
                  
                  )
                
              
            
          
          ]
        
      
      }
    
  
  ->
  Min




where:

    
    
        Cstart(i,t) is the start up cost of the generating bid i at time step t;
        Z(i,t) is the start up binary variable of the generating bid i in time step t;
        Cnold(i,t) is the no load cost segment of the generating bid i in time step t;
        Y(i,t) is the status binary variable of the generating bid i in time step t;
        cen(i,t) is the cost of the commodity energy of the bid i in time step t;
        creg(i,t) is the cost of the commodity regulating reserve energy of bid I in time step t;
    
    


The above formulation assumes that in a most general case the day ahead SCUC is a large co-optimization problem. The co-optimization problem simultaneously clears energy, regulation and other ancillary services, mainly reserves. In the above formulation, the assumption is that three types of reserves can be supported. The three types of reserves are (1) the ten minute spinning reserve, (2) the ten minute non-spinning reserve, and (3) the thirty minutes operating reserve.
The total sum of the supply energy bids must be equal to the sum of load bids of price sensitive loads and load bids of price non-sensitive (fixed) loads for each time step of the study period. The mathematical formulation is:




  
    
      
        
          ∑
          
            i
            =
            1
          
          N
        
        ⁢
        
          
            
              p
              
                en
                ⁢
                
                  
                
              
            
            ⁡
            
              (
              
                i
                ,
                t
              
              )
            
          
          
            pf
            en
          
        
      
      -
      
        
          ∑
          
            j
            =
            1
          
          
            N
            psld
          
        
        ⁢
        
          
            
              p
              psld
            
            ⁡
            
              (
              
                j
                ,
                t
              
              )
            
          
          
            
              pf
              ld
            
            ⁡
            
              (
              
                j
                ,
                t
              
              )
            
          
        
      
    
    =
    
      
        ∑
        
          k
          =
          1
        
        
          N
          fxld
        
      
      ⁢
      
        
          p
          fxld
        
        ⁡
        
          (
          
            k
            ,
            t
          
          )
        
      
    
  
  ,
  
    ∀
    t
  




where:
pen(i,t) is the power of commodity energy of the bid I at time step t;
pfen is the power penalty factor pf the generating bid I at time step t;
ppsld(i,t) is the power of price sensitive load of the load bid i at time step t;
pfld(i,t) is the power penalty factor of the price dependent load bid i at time step t;
pfxld(i,t) is the power of price non-sensitive load of the load bid i at time step t;
The following ancillary services are considered in the present model. The regulating reserve, ten minute spinning reserve, and thirty minute operating reserve. The ancillary service constraints are (1) regulating reserve; (2) ten minute spinning reserve, (3) ten minute non-spinning reserve, and (4) thirty minute operating reserve.
These ancillary services are considered in turn. The regulating reserve must be greater than or equal to the system regulating reserve requirements, expressed mathematically as:




  
    
      
        ∑
        
          i
          =
          1
        
        N
      
      ⁢
      
        
          p
          reg
        
        ⁡
        
          (
          
            i
            ,
            t
          
          )
        
      
    
    ≥
    
      
        P
        reg
        reg
      
      ⁡
      
        (
        t
        )
      
    
  
  ,
  
    ∀
    t
  




where:
preg(i,t) is the power of commodity regulating reserve energy of the bid i at time t;
pregreq(t) is the system regulating reserve requirements at time step t.
and each regulating reserve bid must satisfy the following relations:

0≦preg(i,t)≦min{RR(i,t),ramp10(i),max[0,0.5·(RH(i,t)−SS(i,t))]}·W(i,t),

∀i,t 

where:
RR(i,t) is the regulating reserve range of the generating bid i at time step t;
RH(i,t) is the regulating high capacity limit of the generating bid i at time step t;
SS(i,t) is the self committed and scheduled capacity of the generating bid i at time step t;
W(i,t) is the regulating status binary variable of the generating bid i at time step t;
and ramp10(i) is the ten minute ramp capability of the generating bid i.
For the ten minute spinning reserve, at each time step of the study period, the total ten minute spinning reserve must be greater than or equal to the ten minute spinning reserve requirements, governed by the following mathematical formulation:




  
    
      
        ∑
        
          i
          =
          1
        
        N
      
      ⁢
      
        
          p
          tmsr
        
        ⁡
        
          (
          
            i
            ,
            t
          
          )
        
      
    
    ≥
    
      
        P
        tmsr
        req
      
      ⁡
      
        (
        t
        )
      
    
  
  ,
  
    ∀
    t
  




where:
ptmsr(i,t) is the power of commodity ten minute spinning reserve of bid i at time step t;
and ptmsrreq(t) is the system ten minute spinning reserve requirement at time t.
Each ten minute spinning reserve bid must satisfy the following mathematical formulation:

0≦ptmsr(i,t)≦min[ramp10(i,t),pmax(i,t)−SS(i,t)]·Y(i,t),

As for the ten minute non-spinning reserve, at each time step of the study period, the ten minute non-spinning reserve must be greater than or equal to the system ten minute non spinning reserve requirements by the following mathematical formulation:




  
    
      ∑
      
        i
        =
        1
      
      N
    
    ⁢
    
      
        p
        tmns
      
      ⁡
      
        (
        
          i
          ,
          t
        
        )
      
    
  
  ≥
  
    
      
        P
        tmns
        req
      
      ⁡
      
        (
        t
        )
      
    
    ⁢
    
      
    
    ⁢
    
      ∀
      t
    
  




where:
ptmns(i,t) is the power of commodity ten minute non-spinning reserve of bid i at time step t;
and ptmnsreq(t) is the system ten minute non-spinning reserve requirement at time t.
Each ten minute non-spinning reserve bid must satisfy the following relation in mathematical formulation:

0≦ptmns(i,t)≦min[ramp10(i,t),pmax(i,t)−SS(i,t)]·[1−Y(i,t)]∀i,t 

As for the thirty minute operating reserve, at each time period of the study period, the total thirty minute operating reserve must be greater than or equal to the system thirty minute operating reserve requirements, as governed by the following mathematical formulation:




  
    
      ∑
      
        i
        =
        1
      
      N
    
    ⁢
    
      
        p
        tmor
      
      ⁡
      
        (
        
          i
          ,
          t
        
        )
      
    
  
  ≥
  
    
      
        P
        tmor
        req
      
      ⁡
      
        (
        t
        )
      
    
    ⁢
    
      
    
    ⁢
    
      ∀
      t
    
  




where:
ptmor(i,t) is the power of commodity ten minute operating reserve of bid i at time step t;
and ptmorreq(t) is the system ten minute operating reserve requirement at time t.
Each thirty minute operating reserve bid must satisfy the following relation:

0≦ptmor(i,t)≦min[ramp30(i),pmax(i,t)−SS(i,t)]·[1−Y(i,t)]∀i,t 

Mixed integer linear programming techniques can be used to solve this multivariate problem. Integer linear programming models can be used where variables are constrained to take integer or whole number (as opposed to fractional) values. Mixed integer (MILP or MIP) problems require only some of the variables to take integer values, whereas pure integer (ILP or IP) problems require all variables to be integer.

In most energy markets, the bid cost curves for all commodities such as energy, reserve, ten minute spinning reserve, etc. are defined as piecewise linear curves. One of the main factors impacting the performance of the linear programming algorithms is the number of binary integer variables such as 0 and 1. If each segment of the piecewise linear bid curves for various commodities is modeled as a separate variable, the number of binary integer variables associated with the statuses of units would be equal to the number of bids times the number of segments of the corresponding piecewise linear bid curves.
Therefore, linear commodity bid cost curves are replaced with a single linear term and a set of associated linear equations and variables. Each piecewise linear commodity bid curve has a set of pairs (pcompl(i,t,k),ccompl(i,t,k)) of given vales associated with brake points k of piecewise linear bid cost curves. Since the bid cost curves ccom(i,t)=f(pcom(i,t)) are convex functions, the following linear equations ensure that values of a single term ccom(i,t)=f(pcom(i,t)) remain always on the corresponding piecewise linear curve:



  
    
      
        p
        com
      
      ⁡
      
        (
        
          i
          ,
          t
        
        )
      
    
    =
    
      
        ∑
        k
      
      ⁢
      
        
          
            p
            com
            pl
          
          ⁡
          
            (
            
              i
              ,
              t
              ,
              k
            
            )
          
        
        ·
        
          
            ω
            com
            pl
          
          ⁡
          
            (
            
              i
              ,
              t
              ,
              k
            
            )
          
        
      
    
  




  
    
      
        c
        com
      
      ⁡
      
        (
        
          i
          ,
          t
        
        )
      
    
    =
    
      
        ∑
        k
      
      ⁢
      
        
          
            c
            com
            pl
          
          ⁡
          
            (
            
              i
              ,
              t
              ,
              k
            
            )
          
        
        ·
        
          
            ω
            com
            pl
          
          ⁡
          
            (
            
              i
              ,
              t
              ,
              k
            
            )
          
        
      
    
  



subject to the following constraints:

0≦ωcompl(i,t,k)≦1

and




  
    
      ∑
      k
    
    ⁢
    
      
        ω
        com
        pl
      
      ⁡
      
        (
        
          i
          ,
          t
          ,
          k
        
        )
      
    
  
  =
  1




where ωcompl(i,t,k) are weighting variables associated to the piece-wise linear bid cost curve brake points. This enables modeling of each commodity costs with only one variable ccom(i,t) that follows the convex piece-wise linear curve and that doesn't explicitly depend on brake points and with additional variables ωcompl(i,t,k) subject to the same constraints. To ensure that the solution for ccom(i,t) follows the cost curves exactly under all circumstances (including non-convex curves), in the non-convex case the series ωcompl(i,t,k) cannot have more than two adjacent non-zero elements in the defining ordering of the series. In the general case the variables ωcompl(i,t,k) have to form special order sets (“SOS”) modeled explicitly by the linear programming engine of the CPLEX product.
The solution to the problem is constrained by the following restraints. The bid ramping constraint restricts the maximal up and down changes of the bid's electrical generation between the two consecutive time steps, expressed in the following mathematical constraint:

pen(i,t)−pen(i,t−1)≦rampupmax(i,t) and

pen(i,t−1)−pen(i,t)≦rampdnmax(i,t)

In another embodiment, the bid ramping constraint may need to be defined per segment of energy bid cost curve.
Another constraint is the startup variable and status variable constraints. The following constraints are imposed on start up variable Z(i,t):

Z(i,t−1)−Y(i,t)+Y(i,t−1)≧0

Z(i,t)+Y(i,t)≦1 and

Z(i,t−1)−Y(i,t)≦0

The following constraint is imposed on regulating status variable:

W(i,t)−Y(i,t)≦0

There are additionally minimum up and down time constraints. The following mathematical relationships are related to the constraints n the bids minimum up and down times:

(Y(i,k+t+2)−Y(i,k+t+1))−(Y(i,t+1)−Y(i,t))≧−1

k=0, . . . , MUT(i)−2,

t=0, . . . , tend−k−2

(Y(i,k+t+2)−Y(i,k+t+1))−(Y(i,t+1)−Y(i,t))≦1

k=0, . . . , MUT(i)−2,

t=0, . . . , tend−k−2

Another restraint is the limit on bid powers, as defined mathematically as follows:

pen(i,t)−0.5·preg(i,t)≧pmin(i,t)·Y(i,t)+[RL(i,t)−pmin(i,t)]·W(i,t)

and

pen(i,t)+preg(i,t)+ptmsr(i,t)+ptmnsr(i,t)+ptmor(i,t)≦[pmax(i,t)−SS(i,t)]·Y(i,t)

Another restraint is the transmission constraint. The linear constraints that impose transmission constraints on line k as a function of generating power of bid i are defined by:




  
    
      -
      
        
          P
          lim
          t
        
        ⁡
        
          (
          
            k
            ,
            t
          
          )
        
      
    
    ≤
    
      
        ∑
        
          i
          =
          1
        
        N
      
      ⁢
      
        
          shf
          ⁡
          
            (
            
              k
              ,
              i
            
            )
          
        
        ·
        
          
            p
            en
          
          ⁡
          
            (
            
              i
              ,
              t
            
            )
          
        
      
    
    ≤
    
      
        
          P
          lim
          t
        
        ⁡
        
          (
          
            k
            ,
            t
          
          )
        
      
      ⁢
      
        
      
      ⁢
      
        ∀
        k
      
    
  
  ,
  t




The above described embodiments are merely exemplary. Those of ordinary skill in the art may readily devise their own implementations that incorporate the principles of the present invention and fall within the spirit and scope thereof.

## Claims

1. A computer implemented system for optimal pricing of energy and energy reserve in an electricity market of at least one market participant, said system comprising:
a data base; and
a processor configured for:
determining constraints of said at least one market participant;
receiving reserve energy bids from said market participants;
calculating, using mixed integers to represent variables, whether each reserve bid satisfies the relationship:


0≦preg(i,t)≦min {RR(i,t),ramp10(i),max[0,0.5·(RH(i,t)−SS(i,t))]}·W(i,t)


where preg(i,t) is a power of regulating reserve energy for reserve eneray bid i at time step t, RR(i,t) is a regulating reserve range for the reserve energy bid i at time step t, ramp10(i) is a ten minute ramp capability for the reserve energy bid i at time step t; (RH(i,t) is a regulating high capacity limit for the reserve energy bid i at time step t, SS(i,t) is a self committed and scheduled capacity for the reserve energy bid i at time step t; W(i,t) is a regulating status binary variable for the reserve energy bid i at time step t;
optimizing the dispatch of energy and energy reserve responsive to reserve energy bids that satisfy said relationship considering said constraints of said at least one market participant using mixed integer linear programming techniques; and
pricing the dispatch of energy and energy reserve based on the results of said optimizing step.

2. The system of claim 1, wherein said constraint is a market participant energy limit.

3. The system of claim 1, wherein said constraint is a load energy limit.

4. The system of claim 1, wherein said constraint is a market participant regulation availability.

5. The system of claim 1, wherein said constraint is a market participant regulation range.

6. The system of claim 1, wherein said constraint is a market participant spinning reserve limit.

7. The system of claim 1, wherein said constraint is a load spinning reserve limit.

8. The system of claim 1, wherein said constraint is a market participant non-spinning reserve limit.

9. The system of claim 1, wherein said constraint is a market participant capacity limit.

10. The system of claim 1, wherein said constraint is a load capacity limit.

11. The system of claim 1, wherein said processor is further configured for modeling linear bid curves corresponding to said reserve energy bids using a linear term and at least one associated linear equation in said mixed integer linear programming techniques.

12. The system of claim 1, wherein said processor is further responsive to one or more cost functions associated with generation of energy over a time interval.

13. The system of claim 12 wherein said processor is further configured for minimizing said one or more cost functions.

14. The system of claim 13 wherein said one or more cost functions comprise at least one of a start up cost, a no load cost, a cost of the commodity energy, and a cost of commodity regulating reserve energy.

15. The system of claim 1 wherein said energy reserve comprises at least one of a ten minute spinning reserve, a ten-minute non-spinning reserve, and a thirty minute operating reserve.

16. The system of claim 1, wherein said processor is further responsive to one or more power functions associated with consumption of energy over a time interval.

17. The system of claim 16 wherein said one or more power functions comprise at least one of a power of commodity energy, a power penalty factor, a power of price sensitive load, a power penalty factor of the price dependent load, and a power of price non-sensitive load.

18. A method for optimal pricing of energy and energy reserve in an electricity market of at least one market participant, said method comprising:
determining constraints of said at least one market participant;
receiving reserve energy bids from said market participants;
calculating, using mixed integers to represent variables, whether each reserve bid satisfies the relationship:


0≦preg)(i,t)≦min{RR(i,t),ramp10(i),max[0,0.5·(RH(i,t)−SS(i,t))]}·W(i,t)


where preg(i,t) is a power of regulating reserve energy for reserve energy bid i at time step t, RR(i,t) is a regulating reserve range for the reserve energy bid i at time step t, ramp10(i) is a ten minute ramp capability for the reserve energy bid i at time step t; (RH(i,t) is a regulating high capacity limit for the reserve energy bid i at time step t, SS(i,t) is a self committed and scheduled capacity for the reserve energy bid i at time step t; W(i,t) is a regulating status binary variable for the reserve energy bid i at time step t;
optimizing the dispatch of energy and energy reserve responsive to reserve energy bids that satisfy said relationship considering said constraints of said at least one market participant using a mixed integer linear programming technique wherein linear bid curves corresponding to the energy reserve bids are modeled by a linear term and at least one associated linear equation; and
pricing the dispatch of energy and energy reserve based on the results of said optimizing step.

19. A computer readable medium containing program instructions therein, which, when executed by a computer, causing the computer to implement a method for optimal energy and energy reserve pricing in an electricity market of at least one market participant, said method comprising:
determining constraints of at least one market participant;
receiving reserve energy bids from said market participants;
calculating, using mixed integers to represent variables, whether each reserve bid satisfies the relationship:


0≦preg(i,t)≦min{RR(i,t),ramp10(i),max[0,0.5·(RH(i,t)−SS(i,t))]}·W(i,t)


where preg(i,t) is a power of regulating reserve energy for reserve energy bid i at time step t, RR(i,t) is a regulating reserve range for the reserve energy bid i at time step t, ramp10(i) is a ten minute ramp capability for the reserve energy bid i at time step t; (RH(i,t) is a regulating high capacity limit for the reserve energy bid i at time step t, SS(i,t) is a self committed and scheduled capacity for the reserve energy bid i at time step t; W(i,t) is a regulating status binary variable for the reserve energy bid i at time step t;
optimizing dispatch of energy and energy reserve responsive to reserve energy bids that satisfy said relationship considering said constraints of said at least one market participant using a mixed integer linear programming technique wherein linear bid curves corresponding to the energy reserve bids are modeled by a linear term and at least one associated linear equation; and
pricing the dispatch of energy and energy reserve based on the results of said optimizing step.