5. Modeling and OptimizationΒΆ
In this chapter we discuss how to use MindOpt to solve mathematical optimization problems. We provide a series of examples on constructing different types of optimization models, and calling the optimization solvers to obtain the optimal solutions.
Note
Currently MindOpt only supports linear programming (LP), mixed-integer linear programming (MILP), quadratic programming (QP), quadratically constrained programming (QCP), mixed-integer quadratic programming (MIQP), mixed-integer quadratically constrained programming (MIQCP) and semidefinite programming (SDP). In the future, MindOpt will support more problem types and continuously improve its performance.
- 5.1. Linear Programming (LP)
- 5.2. Mixed-Integer Linear Programming (MILP)
- 5.2.1. Modeling for Mixed-Integer Linear Programming
- 5.2.2. MILP Modeling and Optimization in C
- 5.2.3. MILP Modeling and Optimization in C++
- 5.2.4. MILP Modeling and Optimization in JAVA
- 5.2.5. MILP Modeling and Optimization in Python
- 5.2.6. MILP Modeling and Optimization in C#
- 5.2.7. MILP Warmstart
- 5.2.8. General Constraints in MILP
- 5.2.9. MILP Solution Pool
- 5.3. Quadratic Programming (QP)
- 5.4. Quadratically Constrained Programming (QCP)
- 5.5. Mixed Integer Quadratic Programming (MIQP)
- 5.6. Mixed-Integer Quadratically Constrained Programming (MIQCP)
- 5.6.1. Modeling for Mixed Integer Quadratically Constrained Programming
- 5.6.2. MIQCP Modeling and Optimization in C
- 5.6.3. MIQCP Modeling and Optimization in C++
- 5.6.4. MIQCP Modeling and Optimization in Python
- 5.6.5. MIQCP Modeling and Optimization in Java
- 5.6.6. MIQCP Modeling and Optimization in C#
- 5.7. Semi-Definite Programming (SDP)