Price optimization with rule relaxation
First Claim
Patent Images
1. Computer readable code, embodied on a computer readable media, for computing a preferred set of prices for a plurality of products, comprising an optimization engine comprising computer readable media, comprising:
- computer readable code for storing a plurality of rules, wherein each rule includes constraints;
computer readable code for prioritizing the plurality of rules;
computer readable code for identifying an infeasible rule of the plurality of rules, wherein the infeasible rule is not able to be satisfied;
computer readable code for identifying at least one lower priority rule which has a lower priority than the infeasible rule, wherein the at least one lower priority rule conflicts with the infeasible rule;
computer readable code for incrementally relaxing the at least one lower priority rule to enable the infeasible rule to become feasible, wherein the incremental relaxing of the at least one lower priority rule includes broadening the constraints of the said at least one lower priority rule such that the conflict between the at least one lower priority rule and the infeasible rule is eliminated; and
computer readable code for performing an optimization process, utilizing Bayesian shrinkage modeling, to generate the preferred set of prices wherein the preferred set of prices meets the plurality of rules wherein a rule is feasible if said optimization process can be performed without violating said rule, further wherein the preferred set of prices is a set of product prices generated for said plurality of products.
11 Assignments
0 Petitions
Accused Products
Abstract
A price optimization system computes a preferred set of prices for a plurality of products. The optimization system stores a plurality of rules. The system may also prioritize the plurality of rules, and further relax lower priority rules to allow higher priority rules to become feasible. The feasible set of rules may then be utilized to generate the preferred set of prices.
149 Citations
16 Claims
-
1. Computer readable code, embodied on a computer readable media, for computing a preferred set of prices for a plurality of products, comprising an optimization engine comprising computer readable media, comprising:
-
computer readable code for storing a plurality of rules, wherein each rule includes constraints; computer readable code for prioritizing the plurality of rules; computer readable code for identifying an infeasible rule of the plurality of rules, wherein the infeasible rule is not able to be satisfied; computer readable code for identifying at least one lower priority rule which has a lower priority than the infeasible rule, wherein the at least one lower priority rule conflicts with the infeasible rule; computer readable code for incrementally relaxing the at least one lower priority rule to enable the infeasible rule to become feasible, wherein the incremental relaxing of the at least one lower priority rule includes broadening the constraints of the said at least one lower priority rule such that the conflict between the at least one lower priority rule and the infeasible rule is eliminated; and computer readable code for performing an optimization process, utilizing Bayesian shrinkage modeling, to generate the preferred set of prices wherein the preferred set of prices meets the plurality of rules wherein a rule is feasible if said optimization process can be performed without violating said rule, further wherein the preferred set of prices is a set of product prices generated for said plurality of products. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A method for computing a preferred set of prices for a plurality of products, comprising generating a preferred set of prices in a computer system, comprising, the computer-implemented steps of:
-
storing a plurality of rules, wherein each rule includes constraints; prioritizing the plurality of rules; identifying an infeasible rule of the plurality of rules, wherein the infeasible rule is not able to be satisfied; identifying at least one lower priority rule which has a lower priority than the infeasible rule, wherein the at least one lower priority rule conflicts with the infeasible rule; incrementally relaxing the at least one lower priority rule to enable the infeasible rules to become feasible, wherein the incremental relaxing of the at least one lower priority rule includes broadening the constraints of the said at least one lower priority rule such that the conflict between the at least one lower priority rule and the infeasible rule is eliminated; performing an optimization process, utilizing Bayesian shrinkage modeling, to generate the preferred set of prices wherein the preferred set of prices meets the plurality of rules wherein a rule is feasible if said optimization process can be performed without violating said rule, further wherein the preferred set of prices is a set of product prices generated for said plurality of products; and setting prices for the plurality of products to the preferred set of prices, wherein the setting prices for the plurality of products includes displaying the preferred set of prices on a display on a computer system. - View Dependent Claims (10, 11, 12, 13, 14, 15, 16)
-
Specification