OBS: This program is under construction and many sections/modules are just placeholders for now.

If you have any question or comment, please Reach out to us.

Mip Optimization

Welcome to the Mip Optimization program!

Mathematical optimization is an outstanding technology to solve decision-making problems. Here is a quote taken from the preface of the online book Optimization Models by Fabio Schoen that summarizes it very well:

"Having the possibility of learning from data so that future trends (demand, production, yield, interest rates, …) can be reliably and robustly estimated is absolutely wonderful. However, after a reliable forecast becomes available, managers still need to take decisions. And this is where optimization (operations research) comes into play."

Before you move forward, we recommend that you read the following article to get some more context on what is waiting for you in the program: https://www.mipwise.com/technical-articles/math-optimization

Next | Help

---

References

Here is a list of books for those wanting to take a deeper dive in specific operations research topics:

• Operations Research: Applications and Algorithms; Wayne L. Winston
• Integer and Combinatorial Optimization; George Nemhauser, Laurence Wolsey
• Linear Optimization and Duality: A Modern Exposition; Craig A. Tovey
• Integer Programming; Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli

License

The content of Mip Optimization is licensed under the GNU GPLv3 license.

Contributions and constructive feedback are very welcome. Please Reach out to us.

Table of Content

• Help
• Introduction
  • Mathematical Formulation
  • Tictech Formulation
  • Classes of Optimization
  • Optimization Model
  • Tictech Modeling
  • Next Steps
• Beginner Examples
• Best Practices
  • Data Agnostic
    • jupyter_notebooks
  • Formulation Template
• Formulation Techniques
  • Network Flow Problems
    • data
    • docs
    • formulations
  • Routing Problems
    • data
      • tsp
      • woodler
    • docs
    • formulations
  • Multi Period Problems
    • data
    • docs
    • formulations
  • Scheduling Problems
    • data
      • ucp_data_10_generators
      • ucp_data_20_generators
      • ucp_data_30_generators
      • ucp_data_3_generators
      • ucp_data_40_generators
    • docs
    • formulations
  • Generalized Techniques
    • Absolute Values
    • Basic Logic Opeartions
      • docs
      • formulations
    • Disjunctions
    • Fixed Charge
    • Knapsack Problem
    • Min Max
    • Packing Covering Partitioning
    • Piecewise Linear Functions
• Theoretical Background
  • Solving Integer Programs
    • docs
  • The Simplex Algorithm
  • LP Duality
  • Sensitivity Analysis
  • Branch and Bound
  • Cutting Planes
    • data
    • formulations
• Handling Performance Issues
  • Concurrent LP Solvers
  • Infeasible Models
  • Integer Vs Binary Variables
  • Interpreting The Solver Log
  • Memory Issues
  • Numerical Issues
  • Parameters Tuning
  • Primal Vs Dual Bound
  • Reformulations
  • Symmetry
  • Warm Starting
• Exact Heuristics
  • Callbacks
  • Decompositions
  • Direct Acyclic Graph
  • Set Covering Formulations
  • Smart Restrictions
• miscellaneous
  • Docs
  • notebooks