Framework for solving discrete optimization problems using a combination of Mixed-Integer Linear Programming (MIP) and Machine Learning (ML)
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
Go to file
Alinson S. Xavier a306f0df26
Update docs dependencies; re-run notebooks
4 months ago
docs Update docs dependencies; re-run notebooks 4 months ago
miplearn Fix pyomo warning 4 months ago
tests LearningSolver: return model 1 year ago
.gitignore MIPLearn v0.3 2 years ago
.mypy.ini MIPLearn v0.3 2 years ago
.zenodo.json MIPLearn v0.3 2 years ago
CHANGELOG.md Update CHANGELOG 4 months ago
LICENSE MIPLearn v0.3 2 years ago
Makefile Update docs dependencies; re-run notebooks 4 months ago
README.md Bump version to 0.4 2 years ago
requirements.txt MIPLearn v0.3 2 years ago
setup.py Update docs dependencies; re-run notebooks 4 months ago

README.md

MIPLearn

MIPLearn is an extensible framework for solving discrete optimization problems using a combination of Mixed-Integer Linear Programming (MIP) and Machine Learning (ML). MIPLearn uses ML methods to automatically identify patterns in previously solved instances of the problem, then uses these patterns to accelerate the performance of conventional state-of-the-art MIP solvers such as CPLEX, Gurobi or XPRESS.

Unlike pure ML methods, MIPLearn is not only able to find high-quality solutions to discrete optimization problems, but it can also prove the optimality and feasibility of these solutions. Unlike conventional MIP solvers, MIPLearn can take full advantage of very specific observations that happen to be true in a particular family of instances (such as the observation that a particular constraint is typically redundant, or that a particular variable typically assumes a certain value). For certain classes of problems, this approach may provide significant performance benefits.

Documentation

Authors

  • Alinson S. Xavier (Argonne National Laboratory)
  • Feng Qiu (Argonne National Laboratory)
  • Xiaoyi Gu (Georgia Institute of Technology)
  • Berkay Becu (Georgia Institute of Technology)
  • Santanu S. Dey (Georgia Institute of Technology)

Acknowledgments

  • Based upon work supported by Laboratory Directed Research and Development (LDRD) funding from Argonne National Laboratory, provided by the Director, Office of Science, of the U.S. Department of Energy.
  • Based upon work supported by the U.S. Department of Energy Advanced Grid Modeling Program.

Citing MIPLearn

If you use MIPLearn in your research (either the solver or the included problem generators), we kindly request that you cite the package as follows:

  • Alinson S. Xavier, Feng Qiu, Xiaoyi Gu, Berkay Becu, Santanu S. Dey. MIPLearn: An Extensible Framework for Learning-Enhanced Optimization (Version 0.4). Zenodo (2024). DOI: 10.5281/zenodo.4287567

If you use MIPLearn in the field of power systems optimization, we kindly request that you cite the reference below, in which the main techniques implemented in MIPLearn were first developed:

  • Alinson S. Xavier, Feng Qiu, Shabbir Ahmed. Learning to Solve Large-Scale Unit Commitment Problems. INFORMS Journal on Computing (2020). DOI: 10.1287/ijoc.2020.0976

License

Released under the modified BSD license. See LICENSE for more details.