Improved Method for Mixed Integer Programming (24047)

This invention is an optimization tool with general applicability. It solves problems that otherwise are difficult to solve. It also solves problems more quickly than can be solved by currently available methods. For instance, in solving a set of market share problems, the inventors compared results of their invention with results using state-of-the-art commercial software. Some of the results are presented below.



So for instance, the invention solves the last problem with only 0.5% of the nodes and at 458X the speed of the commercially available method.

The invention uses a modified version of the so-called "Lenstra’s algorithm."

Applications: The invention can be applied to any application involving mixed integer programming.

Stage of Development: Optimization efficiencies are currently being investigated for nonlinear mixed integer programming problems. The inventors would also like to integrate other techniques such as parallel computation and so-called "decomposition methods" for solving large-scale mixed integer programming problems

Inventor(s): Sanjay Mehrotra and Zhifeng Li

Type of Offer: Licensing



Next Patent »
« More Software Patents

Share on      


CrowdSell Your Patent