Method and system for solving a convex integer quadratic programming problem using a binary optimizer
Assignee1Qb Information Technologies Inc.
InventorPooya RONAGH
Life of this patent
Estimating the term…
Abstract
A method and system are disclosed for solving a convex integer quadratic programming problem using a binary optimizer, the method comprising use of a processor for receiving a convex integer quadratic programming problem; converting the convex integer quadratic programming problem into a plurality of constrained and unconstrained binary quadratic programming problems and providing the plurality of unconstrained binary quadratic programming problems to the binary optimizer to thereby solve the convex integer quadratic programming problem.
Claims18
A method for solving a convex integer quadratic programming problem using a binary optimizer, the method comprising:
- using a processor for:
- receiving a convex integer quadratic programming problem;
- converting the convex integer quadratic programming problem into a plurality of constrained and unconstrained binary quadratic programming problems;
- and
- providing the plurality of unconstrained binary quadratic programming problems to the binary optimizer to thereby solve the convex integer quadratic programming problem.
A method for solving a convex integer quadratic programming problem using a binary optimizer, the method comprising:
- receiving, using a processor, a convex integer quadratic programming problem;
- converting, using the processor, the convex integer quadratic programming problem into a plurality of constrained and unconstrained binary quadratic programming problems;
- providing, using the processor, the plurality of unconstrained binary quadratic programming problems to the binary optimizer;
- obtaining from the binary optimizer, using the processor, a plurality of solutions for the plurality of unconstrained binary quadratic programming problems to the binary optimizer;
- and
- determining, using the processor, a solution using at least the plurality of solutions.
A system for solving a convex integer quadratic programming problem, the system comprising:
- a binary optimizer for receiving a plurality of unconstrained binary quadratic programming problems, solving the plurality of unconstrained binary quadratic programming problems and providing a plurality of corresponding solutions;
- and
- a digital computer for receiving a convex integer quadratic programming problem, determining the plurality of constrained and unconstrained binary quadratic problems, providing the plurality of unconstrained binary quadratic problems to the binary optimizer, obtaining from the binary optimizer the plurality of solutions, determining a solution using the plurality of solution and providing the determined solution.
A non-transitory computer-readable storage medium storing computer-executable instructions which, when executed, cause a digital computer to perform a method for solving a convex integer quadratic programming problem using a binary optimizer, the method comprising:
- receiving, using a processor, a convex integer quadratic programming problem;
- converting, using the processor, the convex integer quadratic programming problem into a plurality of constrained and unconstrained binary quadratic programming problems;
- providing, using the processor, the plurality of unconstrained binary quadratic programming problems to the binary optimizer;
- obtaining from the binary optimizer, using the processor, a plurality of solutions for the plurality of unconstrained binary quadratic programming problems to the binary optimizer;
- and
- determining, using the processor, a solution using at least the plurality of solutions.
A digital computer for solving a convex integer quadratic programming problem, the digital computer comprising:
- a display device;
- a processor;
- a communication port;
- a memory unit comprising an application;
- and
- one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more central processing units, the one or more programs including:
- instructions for receiving a convex integer quadratic programming problem;
- instructions for converting the convex integer quadratic programming problem into a plurality of constrained and unconstrained binary quadratic programming problems;
- instructions for providing the plurality of unconstrained binary quadratic programming problems to the binary optimizer;
- instructions for obtaining from the binary optimizer a plurality of solutions for the plurality of unconstrained binary quadratic programming problems to the binary optimizer;
- instructions for determining a solution using at least the plurality of solutions;
- and
- instructions for providing the solution.
Dependencies are inferred from the claim text.