# Patent

## Title
Generalizing an optimized supplier allocation plan

## Abstract

Generating an optimized supplier allocation plan includes identifying parts and suppliers associated with an allocation problem, where each supplier can supply at least one part. One or more objective functions are selected. Each objective function has part variables, and each part variable represents a quantity of a part to be procured from a supplier. At least one constraint constraining at least one part variable is received. The one or more objective functions are optimized with respect to the at least one constraint to yield a value for each part variable. A quantity of each part to be procured from at least one supplier is determined according to the values to generate the optimized supplier allocation plan.

## Background
CLAIM OF PRIORITY
This application is a continuation of U.S. patent application Ser. No. 11/876,941, filed on 23 Oct. 2007 and entitled “Generating an Optimized Supplier Allocation Plan,” now U.S. Pat. No. 7,905,393, which is a continuation of U.S. patent application Ser. No. 10/090,342, filed on 1 Mar. 2002 and entitled “Generating an Optimized Supplier Allocation Plan,” now U.S. Pat. No. 7,343,311. U.S. Pat. Nos. 7,905,393 and 7,343,311 are commonly assigned to the assignee of the present application. The disclosure of related U.S. Pat. Nos. 7,905,393 and 7,343,311 are hereby incorporated by reference into the present disclosure as if fully set forth herein.


TECHNICAL FIELD OF THE INVENTION
This invention relates generally to supply chain planning and more specifically to generating an optimized supplier allocation plan.
BACKGROUND OF THE INVENTION
Companies are often faced with the task of generating an allocation plan for procuring supplies such as parts or materials to meet a projected future demand. The plan may be required to allocate business to suppliers in a manner that optimizes an objective such as minimizing total spending. The optimization may need to conform to constraints such as business rules or contract obligations. The allocation of business may be for parts supplied by multiple suppliers to the sites of a company over many time periods. Typically, supplier allocation plans are generated manually with the help of spreadsheets. The complexity of the problem, however, makes it difficult to manually determine optimal allocations. Consequently, generating supplier allocation plans has posed challenges for companies.
SUMMARY OF THE INVENTION
In accordance with the present invention, disadvantages and problems associated with techniques for generating supplier allocation plans may be reduced or eliminated.
According to one example of the present invention, generating an optimized supplier allocation plan includes identifying parts and suppliers associated with an allocation problem, where each supplier can supply at least one part. One or more objective functions are selected. Each objective function has part variables, and each part variable represents a quantity of a part to be procured from a supplier. At least one constraint constraining at least one part variable is received. The one or more objective functions are optimized with respect to the at least one constraint to yield a value for each part variable. A quantity of each part to be procured from at least one supplier is determined according to the values to generate the optimized supplier allocation plan.
Certain examples of the invention may provide one or more technical advantages. A technical advantage of one example may be that an allocation problem is represented by a mathematical model that includes an objective function and constraints. The objective function is optimized in accordance with the constraints to determine an optimized allocation of business. Another technical advantage of one example may be that the mathematical model may take into account dimensions such as parts, sites, suppliers, and time periods in order to generate an accurate allocation solution. Another technical advantage of one example may be that one or more objective functions such as minimizing total spending costs, maximizing supplier performance, and maximizing contract compliance may be optimized, which may allow a user to consider multiple objectives. Examples of the invention may include none, some, or all of these technical advantages. One or more other technical advantages may be readily apparent to one skilled in the art from the figures, descriptions, and claims included herein.



BRIEF DESCRIPTION OF THE DRAWINGS
For a more complete understanding of the present invention and for further features and advantages, reference is now made to the following description, taken in conjunction with the accompanying drawings, in which:
FIG. 1 illustrates an example system that generates an optimized supplier allocation plan; and
FIG. 2 illustrates an example method for generating an optimized supplier allocation plan.



DETAILED DESCRIPTION OF THE DRAWINGS
Examples of the present invention and its advantages are best understood by referring to FIGS. 1 and 2 of the drawings, like numerals being used for like and corresponding parts of the various drawings.
FIG. 1 illustrates an example system 10 that generates an optimized supplier allocation plan. According to one example, the supplier allocation plan specifies quantities of supplies such as parts to be procured from suppliers for use at the sites of a company over several time periods.
In general, system 10 formulates an allocation problem as a mixed integer programming problem that can be solved using standard mathematical programming solver techniques. The allocation problem is represented as an object model that comprises collections of business objects. A mathematical model is generated from the object model. The mathematical model represents the allocation problem as an optimization problem that includes an objective function and constraints. The objective function is optimized in accordance with the constraints to determine an optimized solution.
System 10 may include a client system 20, a server system 22, and a database 24 internal or external to server system 22, each of which may operate on one or more computers at one or more locations. A computer may include appropriate input devices, output devices, mass storage media, processors, memory, or other components for receiving, processing, storing, and communicating information according to the operation of system 10. As used in this document, the term “computer” refers to any suitable device operable to accept input, process the input according to predefined rules, and produce output, for example, a personal computer, workstation, or any other suitable processing device.
Server system 22 manages applications that generate an optimized supplier allocation plan. Server system 22 may include an object model module 30, a mathematical model module 32, and a solver 34. Object model module 30 generates an object model that describes an allocation problem and can be reported by client system 20. For example, the object model may describe the parts that are needed, the sites that need the parts, the suppliers that can provide the parts, and the time periods during which the parts are needed. The object model may describe, however, any suitable feature of an allocation problem, for example, the demand for a part at a site during a time period, a maximum quantity of a part that can be ordered from a supplier for a site during a time period, or a minimum number of suppliers for a part needed at a site during a particular time period. “Parts” may refer to any suitable supply provided by a supplier, for example, materials, products, or services.
Mathematical model module 32 generates a mathematical model from the object model generated by object model module 30. A mathematical model includes one or more objective functions that represent an objective to be optimized. Objectives may include, for example, minimizing total cost. Other objectives, however, may be used, for example, maximizing supplier performance. Constraints that restrict the optimization of the objective functions may also be included. Constraints may include, for example, a demand requirement for a part at a site. Other constraints, however, may be used, for example, a maximum spending amount for a part supplied by a supplier for a site during a time period.
Solver 34 solves the mathematical model generated by mathematical model module 32 in order to yield an optimized solution to the allocation problem. Solver 34 may comprise a mathematical programming optimizer such as ILOG CPLEX by ILOG, INC., or XPRESS by DASH OPTIMIZATION, or any other suitable mathematical programming optimizer. The applications of server system 22 may comprise software, hardware, or any suitable combination of software and hardware. For example, the applications may comprise JAVA BEAN components that reside in a container such as WEBLOGIC container. The applications may have interfaces to database 24.
Database 24 includes supply information 40, variables 47, parameters 48, objective functions 50, and constraints 52. Supply information 40 includes information that may be used to set up an allocation problem, for example, part information 42, site information 44, and supplier information 46. Part information 42 describes the parts that are needed by the sites described by site information 44. The sites may include, for example, store locations. The sites, however, may include any suitable entity that may receive supplies from a supplier, such as manufacturing locations, departments of a company, or multiple companies. Supply information 46 describes the suppliers that can supply the parts to the sites.
Variables 47 include variables that are used in the mathematical model. According to one example, variables 47 include:

    
    
        xijkt: quantity of part i from supplier j supplied to site k at period t; and
        fijkt: cost function of part i from supplier j to site k at period t.
    
    


Variable xijkt may be referred to as a “part variable,” The cost function may comprise a linear function or piecewise linear function. The total cost of supplying xijkt is fijkt(xijkt).
Parameters i, j, k, and t may represent an individual entity, for example, an individual part, supplier, site, and period, respectively. The parameters, however, may represent any suitable grouping of entities. According to one example, the parameters may represent a set of entities, for example, a set of functionally equivalent parts, suppliers, sites, and periods, respectively. Parts, suppliers, and sites may be grouped into categories with priority rankings defined for each category. As used in this document, “each” refers to each member of a set or each member of a subset of the set.
Parameters 48 comprise constants that are used to formulate the allocation problem. According to one example, parameters 48 may include:

    
    
        cijkt: unit cost of part i from supplier j to site k at period t when the cost function is linear, such that fijkt(xijkt)=cijkt xijkt;
        dikt: demand for part i to site k at period t;
        qijkt: minimum quantity from supplier j for part i to site k at period t;
        Qijkt: maximum quantity from supplier j for part i to site k at period t;
        qpijkt: minimum quantity percentage of part i from supplier j to site k at period t;
        QPijkt: maximum quantity percentage of part i from supplier j to site k at period t;
        sijkt: minimum spend with supplier j for part i to site k at period t;
        Sijkt: maximum spend with supplier j for part i to site k at period t;
        spijkt: minimum spend percentage with supplier j for part i to site k at period t;
        SPijkt: maximum spend percentage with supplier j for part i to site k at period t;
        csijkt: conditional minimum spend with supplier j for part i to site k at period t;
        cspijkt: conditional minimum spend percentage with supplier j for part i to site k at period t;
        nsijkt: minimum number of suppliers for part i to site k at period t;
        NSikt: maximum number of suppliers for part i to site k at period t;
        mcj: Boolean value indicating whether supplier j matches characteristic c or not;
        nspcikt: minimum percentage of suppliers matching characteristic c for part i to site k at period t;
        NSPcikt: maximum percentage of suppliers matching characteristic c for part i to site k at period t;
        pspikt: primary supplier spend percentage for part i to site k at period t;
        sspikt: secondary supplier spend percentage for part i to site k at period t;
        PijktI: performance factor I of supplier j for part i to site k at period t;
        wpI: weight of performance factor I;
        rijktI: risk factor I of supplier j for part i to site k at period t;
        wrI: weight of risk factor I;
        srbijkt: spend to get rebate from supplier j for part i to site k at period t;
        rbijkt: rebate from supplier j for part i to site k at period t on reaching spend of srbijkt;
        spnijkt spend to avoid penalty from supplier j for part i to site k at period t;
        pnijkt: penalty from supplier j for part i to site k at period t if spend of spnijkt is not reached;
        NP: total number of parts;
        NS: total number of suppliers;
        NK: total number of sites;
        NT: total number of periods;
        NF: total number of performance factors; and
        NR: total number of risk factors.
    
    


Although examples of variables 47 and parameters 48 are described, variables 47 and parameters 48 may include any variables and parameters, respectively, suitable for use in an allocation problem.
Objective functions 50 and constraints 52 are used in the mathematical model. Objective functions 50 describe an objective that is to be optimized by the supplier allocation plan. Objectives may include, for example, minimizing total cost, minimizing target supplier spend, maximizing contract compliance, maximizing supplier performance, and minimizing supplier risk. If multiple objectives are selected, they may be normalized and weighted by user specified weighting factors.
According to one example, objective functions 50 may include, for example, the following:
Minimize Total Spend




  minimize
  ⁢
  
    
      ∑
      
        i
        =
        1
      
      NP
    
    ⁢
    
      
    
    ⁢
    
      
        ∑
        
          j
          =
          1
        
        NS
      
      ⁢
      
        
      
      ⁢
      
        
          ∑
          
            k
            =
            1
          
          NK
        
        ⁢
        
          
        
        ⁢
        
          
            ∑
            
              t
              =
              1
            
            NT
          
          ⁢
          
            
          
          ⁢
          
            
              f
              ijkt
            
            ⁡
            
              (
              
                x
                ijkt
              
              )
            
          
        
      
    
  




Rebates and penalties may be included to take into account contract compliance:




  minimize
  ⁢
  
    
      ∑
      
        i
        =
        1
      
      NP
    
    ⁢
    
      
    
    ⁢
    
      
        ∑
        
          j
          =
          1
        
        NS
      
      ⁢
      
        
      
      ⁢
      
        
          ∑
          
            k
            =
            1
          
          NK
        
        ⁢
        
          
        
        ⁢
        
          
            ∑
            
              t
              =
              1
            
            NT
          
          ⁢
          
            
          
          ⁢
          
            (
            
              
                
                  f
                  ijkt
                
                ⁡
                
                  (
                  
                    x
                    ijkt
                  
                  )
                
              
              +
              
                
                  y
                  ijkt
                
                ⁢
                
                  rb
                  ijkt
                
              
              -
              
                
                  z
                  ijkt
                
                ⁢
                
                  pn
                  ijkt
                
              
            
            )
          
        
      
    
  




subject to

fijkt(xijkt)−srbijkt−Mijktyijkt≦−mijkt 

fijkt(xijkt)−srbijkt−Mijktyijkt≧−mijkt 

fijkt(xijkt)−spnijkt+Mijktzijkt≦Mijkt 

fijkt(xijkt)−spnijkt+Mijktzijkt≦0

where yijkt and are zijkt binary variables, Mijkt is a large positive number, and mijkt is a small positive number.
Minimize Target Supplier Spend




  
    minimize
    ⁢
    
      
        ∑
        
          i
          =
          1
        
        NP
      
      ⁢
      
        
      
      ⁢
      
        
          ∑
          
            k
            =
            1
          
          NK
        
        ⁢
        
          
        
        ⁢
        
          
            ∑
            
              t
              =
              1
            
            NT
          
          ⁢
          
            
          
          ⁢
          
            
              f
              ijkt
            
            ⁡
            
              (
              
                x
                ijkt
              
              )
            
          
        
      
    
  
  ,
  
    for
    ⁢
    
      
    
    ⁢
    target
    ⁢
    
      
    
    ⁢
    supplier
    ⁢
    
      
    
    ⁢
    j
  




The target supplier's allocations may be fixed at the optimized values resulting from the above objective, and another optimization may be performed with the objective of minimizing total spending.
Maximize Target Supplier Spend




  
    
      m
      ⁢
      aximize
    
    ⁢
    
      
        ∑
        
          i
          =
          1
        
        NP
      
      ⁢
      
        
      
      ⁢
      
        
          ∑
          
            k
            =
            1
          
          NK
        
        ⁢
        
          
        
        ⁢
        
          
            ∑
            
              t
              =
              1
            
            NT
          
          ⁢
          
            
          
          ⁢
          
            
              f
              ijkt
            
            ⁡
            
              (
              
                x
                ijkt
              
              )
            
          
        
      
    
  
  ,
  
    for
    ⁢
    
      
    
    ⁢
    target
    ⁢
    
      
    
    ⁢
    supplier
    ⁢
    
      
    
    ⁢
    j
  




The target supplier's allocations may be fixed at the optimized values resulting from the above objective, and another optimization may be performed with the objective of minimizing total spending.
Maximize Supplier Performance




  maximize
  ⁢
  
    
      ∑
      
        i
        =
        1
      
      NP
    
    ⁢
    
      
    
    ⁢
    
      
        ∑
        
          j
          =
          1
        
        NS
      
      ⁢
      
        
      
      ⁢
      
        
          ∑
          
            k
            =
            1
          
          NK
        
        ⁢
        
          
        
        ⁢
        
          
            ∑
            
              t
              =
              1
            
            NT
          
          ⁢
          
            
              ∑
              
                l
                =
                1
              
              NP
            
            ⁢
            
              
                wp
                l
              
              ⁢
              
                p
                ijktl
              
              ⁢
              
                
                  f
                  ijkt
                
                ⁡
                
                  (
                  
                    x
                    ijkt
                  
                  )
                
              
            
          
        
      
    
  




Minimize Supplier Risk




  
    m
    ⁢
    inimize
  
  ⁢
  
    
      ∑
      
        i
        =
        1
      
      NP
    
    ⁢
    
      
    
    ⁢
    
      
        ∑
        
          j
          =
          1
        
        NS
      
      ⁢
      
        
      
      ⁢
      
        
          ∑
          
            k
            =
            1
          
          NK
        
        ⁢
        
          
        
        ⁢
        
          
            ∑
            
              t
              =
              1
            
            NT
          
          ⁢
          
            
              ∑
              
                l
                =
                1
              
              NP
            
            ⁢
            
              
                wr
                l
              
              ⁢
              
                r
                ijktl
              
              ⁢
              
                
                  f
                  ijkt
                
                ⁡
                
                  (
                  
                    x
                    ijkt
                  
                  )
                
              
            
          
        
      
    
  




Although examples of objective functions 50 are described, objective functions 50 may include any suitable objective function that describes an objective to be optimized.
Constraints 52 restrict the optimization of objective functions 50. Constraints 52 may be automatically generated in response to supply information 40 stored in database 24, or constraints 52 may be created or modified in response to input received from client system 20. Constraints 52 may include, for example, business rules 54, contract rules 56, and supplier factors 58. Business rules 54 may include, for example:

    
    
        Projected demand for each part at each site should be met for every period;
        Single sourcing of parts should be avoided;
        Number of suppliers getting business should not exceed specified its;
        Percentage of suppliers with certain characteristics, for example, minority owned, should be within specified limits;
        Total spending or spending percentage with each supplier should be within specified limits;
        Total allocation quantity or quantity percentage for each supplier should be within specified limits;
        Percentage of spending with each supplier should be within specified limits;
        Minimum spending or spending percentage requirements for any business with each supplier should be met;
        Minimum supplier performance and risk thresholds should be met; and
        Minimum spending percentages for primary and secondary suppliers should be met.
    
    


Contract rules 56 include constraints 52 that are specified by agreements. Agreements may specify, for example, contract effectiveness period, rebates, discounts, and penalties. Agreements may include descriptions of price schemes such as an order amount, order quantity, order quantity by period, simple price, step amount, step quantity, and step quantity by period.
Supplier factors 58 quantitatively describe factors about suppliers that may be taken into consideration when generating the supplier allocation plan. Supplier factors 58 may include, for example, supplier performance factors calculated from scores used to evaluate the suppliers and supplier risk factors determined from financial information about the suppliers.
According to one example, constraints 52 may include, for example, the following:
Demand Requirement.
For a part, site, and time period, the total quantity from the suppliers must be greater than or equal to the demand. According to one example, demand may be exceeded, because in some cases, for example, where discounts and rebates apply, it may be cheaper to buy more than the demand.




  
    
      ∑
      
        j
        =
        1
      
      NS
    
    ⁢
    
      x
      ijkt
    
  
  ≥
  
    d
    ikt
  




Minimum/Maximum Quantity Requirement.
For a part, supplier, site, and time period, the quantity must be greater than or equal to a minimum quantity and less than or equal to a maximum quantity.

qijkt≦xijkt≦Qijkt 

Minimum/Maximum Spending Requirement.
For a part, supplier, site, and time period, the total spend must be greater than or equal to a minimum spend and less than or equal to a maximum spend

sijkt≦fijkt(xijkt)≦Sijkt 

Minimum/Maximum Supplier Quantity Percentage Requirement.
For a supplier, the quantity percentage of the suppliers for a part, site, and time period quantity must be greater than or equal to a minimum quantity percentage and less than or equal to a maximum quantity percentage.



  
    
      
        x
        ijkt
      
      -
      
        
          
            qp
            ijkt
          
          100
        
        ⁢
        
          
            ∑
            
              j
              =
              1
            
            NS
          
          ⁢
          
            x
            ijkt
          
        
      
    
    ≥
    0
  




  
    
      
        x
        ijkt
      
      -
      
        
          
            Qp
            ijkt
          
          100
        
        ⁢
        
          
            ∑
            
              j
              =
              1
            
            NS
          
          ⁢
          
            x
            ijkt
          
        
      
    
    ≤
    0
  



Minimum/Maximum Supplier Spending Percentage Requirement.
For a supplier, the spend percentage of the suppliers for a part, site, and time period must be greater than or equal to a minimum spend percentage and less than or equal to a maximum spend percentage.



  
    
      
        
          f
          ijkt
        
        ⁡
        
          (
          
            x
            ijkt
          
          )
        
      
      -
      
        
          
            sp
            ijkt
          
          100
        
        ⁢
        
          
            ∑
            
              j
              =
              1
            
            NS
          
          ⁢
          
            
              f
              ijkt
            
            ⁡
            
              (
              
                x
                ijkt
              
              )
            
          
        
      
    
    ≥
    0
  




  
    
      
        
          f
          ijkt
        
        ⁡
        
          (
          
            x
            ijkt
          
          )
        
      
      -
      
        
          
            SP
            ijkt
          
          100
        
        ⁢
        
          
            ∑
            
              j
              =
              1
            
            NS
          
          ⁢
          
            
              f
              ijkt
            
            ⁡
            
              (
              
                x
                ijkt
              
              )
            
          
        
      
    
    ≤
    0
  



Conditional Minimum Spending Requirements.
For a part, supplier, site, and time period, the total spend must be either 0 or greater than or equal to a conditional minimum spend

fijkt(xijkt)−Mijktyijkt≦0

fijkt(xijkt)−csijktyijkt≦0

where yijkt is a binary variable and Mijkt is a large number.
Conditional Minimum Spending Percentage Requirement.
For a supplier, the spend percentage of the suppliers for a part, site, and time period must be either 0 or greater than or equal to a conditional minimum spend percentage



  
    
      
        
          f
          ijkt
        
        ⁡
        
          (
          
            x
            ijkt
          
          )
        
      
      -
      
        
          M
          ijkt
        
        ⁢
        
          y
          ijkt
        
      
    
    ≤
    0
  




  
    
      
        
          f
          ijkt
        
        ⁡
        
          (
          
            x
            ijkt
          
          )
        
      
      -
      
        
          
            csp
            ijkt
          
          100
        
        ⁢
        
          
            ∑
            
              j
              =
              1
            
            NS
          
          ⁢
          
            
              f
              ijkt
            
            ⁡
            
              (
              
                x
                ijkt
              
              )
            
          
        
      
      -
      
        
          M
          ijkt
        
        ⁢
        
          y
          ijkt
        
      
    
    ≥
    
      -
      
        M
        ijkt
      
    
  



where yijkt is a binary variable and Mijkt is a large number.
Minimum/Maximum Number of Suppliers Requirement.
For a part, site, and time period, the total number of suppliers must be greater than or equal to a minimum number of suppliers and less than or equal to a maximum number of suppliers



  
    
      
        x
        ijkt
      
      -
      
        
          M
          ijkt
        
        ⁢
        
          y
          ijkt
        
      
    
    ≤
    0
  




  
    
      
        x
        ijkt
      
      -
      
        
          m
          ijkt
        
        ⁢
        
          y
          ijkt
        
      
    
    ≥
    0
  




  
    
      ns
      ikt
    
    ≤
    
      
        ∑
        
          j
          =
          1
        
        NS
      
      ⁢
      
        y
        ijkt
      
    
    ≤
    
      NS
      ikt
    
  



where yijkt is a binary variable, Mijkt is a large number, and mijkt is a small positive number.
Minimum/Maximum Percentage of Suppliers Matching Characteristics Requirement.
For a part, site, and time period, the percentages of allocated suppliers matching a certain characteristic must be greater than or equal to a minimum percentage and less than or equal to a maximum percentage



  
    
      
        x
        ijkt
      
      -
      
        
          M
          ijkt
        
        ⁢
        
          y
          ijkt
        
      
    
    ≤
    0
  




  
    
      
        x
        ijkt
      
      -
      
        
          m
          ijkt
        
        ⁢
        
          y
          ijkt
        
      
    
    ≥
    0
  




  
    
      
        
          nsp
          ikt
          c
        
        100
      
      ⁢
      
        
          ∑
          
            j
            =
            1
          
          NS
        
        ⁢
        
          y
          ijkt
        
      
    
    ≤
    
      
        ∑
        
          j
          =
          1
        
        NS
      
      ⁢
      
        
          m
          i
          c
        
        ⁢
        
          y
          ijkt
        
      
    
    ≤
    
      
        
          NSP
          ikt
          c
        
        100
      
      ⁢
      
        
          ∑
          
            j
            =
            1
          
          NS
        
        ⁢
        
          y
          ijkt
        
      
    
  



where yijkt is a binary variable, Mijkt is a large number, and mijkt is a small positive number.
Primary Supplier Allocation Requirement.
For a part, site, and time period, the allocation of business to a primary supplier must be at least pspijkt % of the spend to all suppliers



  
    
      
        
          f
          ijkt
        
        ⁡
        
          (
          
            x
            ijkt
          
          )
        
      
      -
      
        
          
            psp
            ijkt
          
          100
        
        ⁢
        
          
            ∑
            
              j
              =
              1
            
            NS
          
          ⁢
          
            
              f
              ijkt
            
            ⁡
            
              (
              
                x
                ijkt
              
              )
            
          
        
      
      -
      
        
          M
          ijkt
        
        ⁢
        
          y
          ijkt
        
      
    
    ≤
    
      -
      
        m
        ijkt
      
    
  




  
    
      
        
          f
          ijkt
        
        ⁡
        
          (
          
            x
            ijkt
          
          )
        
      
      -
      
        
          
            psp
            ijkt
          
          100
        
        ⁢
        
          
            ∑
            
              j
              =
              1
            
            NS
          
          ⁢
          
            
              f
              ijkt
            
            ⁡
            
              (
              
                x
                ijkt
              
              )
            
          
        
      
      -
      
        
          M
          ijkt
        
        ⁢
        
          y
          ijkt
        
      
    
    ≥
    
      -
      
        M
        ijkt
      
    
  




  
    
      
        ∑
        
          j
          =
          1
        
        NS
      
      ⁢
      
        y
        ijkt
      
    
    ≥
    1
  



where yijkt is a binary variable, Mijkt is a large number, and mijkt is a small positive number.
Secondary Supplier Allocation Requirement.
For a part, site, and time period, the allocation of business to a secondary supplier must be at least sspIkt % of spend to all suppliers



  
    
      
        
          f
          ijkt
        
        ⁡
        
          (
          
            x
            ijkt
          
          )
        
      
      -
      
        
          
            ssp
            ijkt
          
          100
        
        ⁢
        
          
            ∑
            
              j
              =
              1
            
            NS
          
          ⁢
          
            
              f
              ijkt
            
            ⁡
            
              (
              
                x
                ijkt
              
              )
            
          
        
      
      -
      
        
          M
          ijkt
        
        ⁢
        
          y
          ijkt
        
      
    
    ≤
    
      -
      
        m
        ijkt
      
    
  




  
    
      
        
          f
          ijkt
        
        ⁡
        
          (
          
            x
            ijkt
          
          )
        
      
      -
      
        
          
            ssp
            ijkt
          
          100
        
        ⁢
        
          
            ∑
            
              j
              =
              1
            
            NS
          
          ⁢
          
            
              f
              ijkt
            
            ⁡
            
              (
              
                x
                ijkt
              
              )
            
          
        
      
      -
      
        
          M
          ijkt
        
        ⁢
        
          y
          ijkt
        
      
    
    ≥
    
      -
      
        M
        ijkt
      
    
  




  
    
      
        ∑
        
          j
          =
          1
        
        NS
      
      ⁢
      
        y
        ijkt
      
    
    ≥
    2
  



where yijkt is a binary variable, Mijkt is a large number, and mijkt is a small positive number.
Constraints 52 may be ranked in order of priority. A solution that satisfies all selected constraints 52 may be attempted. If such a solution is not possible, a solution that satisfies as many of the higher priority constraints 52 may be attempted. Although examples of constraints 52 such as business rules 54, contract rules 56, and supplier factors 58 are illustrated, constraints 52 may include any constraint suitable for constraining an objective function.
FIG. 2 is a flowchart illustrating an example method for generating an optimized supplier allocation. The method begins at step 100, where object model module 30 initiates an object model that describes an allocation problem. The object model may be displayed on client system 20. At steps 102 through 108, object model module 30 receives information to complete the object model. Object model module 30 receives parameters 48 describing the allocation problem at step 102. Parameters 48 may be retrieved from database 24, and a have originally been input using client system 20. Supply information 40 is received at step 104. Object model module 30 may retrieve supply information 40 from database 24, display supply information 40 on client system 20 for a user to select or modify, and receive selected or modified supply information 40 from client system 20.
Constraints are determined at step 106. Object model module 30 may retrieve constraints 52 from database 24, display constraints 52 on client system 20 for a user to select or modify, and receive selected or modified constraints 52 from client system 20. One or more objective functions 50 are determined at step 107. Object model module 30 may retrieve objective functions 50 from database 24, display objective functions 50 on client system 20 for a user select or modify, and receive selected or modified objective functions 50 from client system 20. An objective function 50 is selected to be included in the object model at step 108.
Mathematical model module 32 generates a mathematical model from the object model at step 110. Solver 34 optimizes the objective function 50 of the object model subject to constraints 52 at step 112 to yield optimized values. If there is a next objective function 50 at step 113, server system 22 returns to step 108 to select the next objective function 50. If there is no next objective function 50 at step 113, server system 22 proceeds to step 114.
Multiple objective functions may be combined and optimized to determine an optimized supplier allocation plan. If multiple objective functions are to be optimized at step 114, server system 22 proceeds to step 115 to optimize the multiple objective functions to yield optimized values. For example, a first objective function may be optimized to determine a first normalization factor, and a second objective function may be optimized to determine a second normalization factor. The first normalization factor may be used to normalize the first objective function, and the second normalization factor may be used to normalize the second objective function. The normalized first objective function and the normalized second objective function may be added together to form a combined objective function that may be optimized. According to one example, a first weighting factor may be used to weight the optimized values from the first objective function, and a second weighting factor may be used to weight the optimized values from the second objective function. The weighted first objective function and the weighted second objective function may be added together to form a combined objective function that may be optimized. If multiple objective functions are not to be optimized at step 114, server system 22 proceeds directly to step 116.
A supplier allocation plan in accordance with the optimized values at step 116. According to one example, the optimized values describe an optimized quantity of parts to be ordered from a supplier for a site at a time period. The supplier allocation plan may specify quantities of parts to be ordered from the suppliers for the sites at different time periods in accordance with the optimized values.
The optimized supplier allocation plan is reported at step 118. To report the supplier allocation plan, object model module 30 may translate the solved mathematical model to an object model that may be displayed on client system 20. Constraints 52 may be modified to determine how different constraints 52 affect resulting optimized values. If one or more constraints 52 are to be modified at step 120, constraints 52 are modified at step 122 and server system 22 returns to step 110, where mathematical model module 32 generates a mathematical model that includes the modified constraints 52. If constraints 52 are not to be modified at step 120, server system 22 proceeds to step 124.
The object model may be modified to determine optimized values for a different object model. If the object model is to be modified at step 124, server system 22 proceeds to step 126, where the object model is modified, and returns to step 110, where mathematical model module 32 generates a mathematical model from the modified object model. If the object model is not to be modified at step 124, the method ends.
Certain examples of the invention may provide one or more technical advantages. A technical advantage of one example may be that an allocation problem is represented by a mathematical model that includes an objective function 50 and constraints 52. Objective function 50 is optimized in accordance with constraints 52 to determine an optimized allocation of business. Another technical advantage of one example may be that the mathematical model may take into account dimensions such as parts, sites, suppliers, and time periods in order to generate an accurate allocation solution. Another technical advantage of one example may be that one or more objective functions 50 such as minimizing total spending costs, maximizing supplier performance, and maximizing contract compliance may be optimized, which may allow a user to consider multiple objectives.
Although an example of the invention and its advantages are described in detail, a person skilled in the art could make various alterations, additions, and omissions without departing from the spirit and scope of the present invention as defined by the appended claims.

## Claims

1. A system, comprising:
a supply chain network comprising one or more suppliers and two or more sites;
a computer system coupled with a database stored on a non-transitory computer readable medium, the computer system comprising a processor, a memory, an object model configured to generate a mathematical model representing an allocation problem as an optimization problem comprising an objective function and one or more constraints, wherein each of the one or more objective functions comprises two or more part variables, each part variable representing a quantity of a part to be procured from the one or more suppliers, the computer system configured to:
receive the one or more constraints from the database;
optimize the objective function subject to the one or more constraints to solve the mathematical model and determine an optimized solution to the allocation problem;
receive one or more inputs comprising modifications to at least one of the objective function and the one or more constraints from the database;
modify the one or more constraints based on the one or more inputs;
determine a correlation between the one or more constraints and the resulting optimized solution by solving a new mathematical model based on the one or more modified constraints;
modify the object model based on the one or more inputs;
determine a correlation between the modified object model and the resulting optimized solution by solving a second new mathematical model based on the modified object model; and
determine a quantity of each part to be procured from at least one of the one or more suppliers based on the optimized solution of the allocation problem; and

cause the quantity of each part to be procured by at least one of the two or more sites based, at least in part, on the optimized solution of the allocation problem.

2. The system of claim 1, wherein the one or more constraints are selected from the set comprising business rules, contract requirements, and supplier factors.

3. The system of claim 1, wherein the one or more constraints are business rules comprising a requirement to meet a projected demand for each of two or more parts at each of the two or more sites for a particular time period.

4. The system of claim 1, wherein the one or more constraints are business rules comprising a requirement that the number of suppliers for one or more parts fall within a specified range.

5. The system of claim 1, wherein the one or more constraints are contract rules comprising rebates, discounts, and penalties.

6. The system of claim 1, wherein the one or more constraints are contract rules, and the objective function is optimized to maximize contract compliance with respect to the contract rules.

7. The system of system of claim 1, wherein the one or more constraints are a set of supplier factors comprising supplier evaluation performance scores.

8. A computer-implemented method, comprising:
initiating an object model configured to generate a mathematical model representing an allocation problem as an optimization problem comprising an objective function and one or more constraints, wherein each of the one or more objective functions comprises two or more part variables, each part variable representing a quantity of a part to be procured from one or more suppliers;
receiving the one or more constraints from a database stored on a non-transitory computer- readable medium coupled with a computer system;
optimizing the objective function subject to the one or more constraints to solve the mathematical model and determine an optimized solution to the allocation problem;
receiving one or more inputs comprising modifications to at least one of the objective function and the one or more constraints from the database;
modifying the one or more constraints based on the one or more inputs;
determining a correlation between the modified one or more constraints and the resulting optimized solution by solving a new mathematical model based on the one or more modified constraints;
modifying the object model based on the one or more inputs;
determining a correlation between the modified object model and the resulting optimized solution by solving a second new mathematical model based on the modified object model;
determining, by at least one supplier, a quantity of each part to be procured based on the optimized solution of the allocation problem; and
causing the quantity of each part to be procured by at least one of the two or more sites based, at least in part, on the optimized solution of the allocation problem.

9. The computer-implemented method of claim 8, wherein the one or more constraints are selected from the set of business rules, contract requirements, and supplier factors.

10. The computer-implemented method of claim 8, wherein the one or more constraints are business rules comprising a requirement to meet a projected demand for each of two or more parts at each of the two or more sites for a particular time period.

11. The computer-implemented method of claim 8, wherein the one or more constraints are business rules comprising a requirement that the number of suppliers for one or more parts fall within a specified range.

12. The computer-implemented method of claim 8, wherein the one or more constraints are contract rules comprising rebates, discounts, and penalties.

13. The computer-implemented method of claim 8, wherein the one or more constraints are contract rules, and the objective function is optimized to maximize contract compliance with respect to the contract rules.

14. The computer-implemented method of claim 8, wherein the one or more constraints are a set of supplier factors comprising supplier evaluation performance scores.

15. A non-transitory computer-readable medium embodied with software, the software when executed using one or more computers is configured to:
initiate an object model to generate a mathematical model representing an allocation problem as an optimization problem comprising an objective function and one or more constraints wherein each of the one or more objective functions comprises two or more part variables, each part variable representing a quantity of a part to be procured from one or more suppliers;
receive the one or more constraints from a database;
optimize the objective function subject to the one or more constraints to solve the mathematical model and determine an optimized solution to the allocation problem;
receive one or more inputs comprising modifications to at least one of the objective function and the one or more constraints from the database;
modify the one or more constraints based on the one or more inputs;
determine a correlation between the modified one or more constraints and the resulting optimized solution by solving a new mathematical model based on the one or more modified constraints;
modify the object model based on the one or more inputs;
determine a correlation between the modified object model and the resulting optimized solution by solving a second new mathematical model based on the modified object model;
determine a quantity of each part to be procured from at least one supplier based on the optimized solution of the allocation problem; and
cause the quantity of each part to be procured by at least one of the two or more sites based, at least in part, on the optimized solution of the allocation problem.

16. The non-transitory computer-readable medium of claim 15, wherein the one or more constraints are selected from the set of business rules, contract requirements, and supplier factors.

17. The non-transitory computer-readable medium of claim 15, wherein the one or more constraints are business rules comprising a requirement to meet a projected demand for each of two or more parts at each of the two or more sites for a particular time period.

18. The non-transitory computer-readable medium of claim 15, wherein the one or more constraints are business comprising a requirement that the number of suppliers for one or more parts fall within a specified range.

19. The non-transitory computer-readable medium of claim 15, wherein the one or more constraints are contract rules comprising rebates, discounts, and penalties.

20. The non-transitory computer-readable medium of claim 15, wherein the one or more constraints are contract rules, and the objective function is optimized to maximize contract compliance with respect to the contract rules.