5. Modeling and Optimization¶
This topic describes how to use MindOpt to solve math programming problems. Examples are provided to help you understand how to define an optimization model in your program, call the optimization solver to solve problems, and obtain the optimal solution.
Note
At present, you can use MindOpt to solve only linear programming (LP), quadratic programming (QP), semi-definite programming (SDP) and mixed-integer linear programming problems. In the future, MindOpt will support more types of optimization problems, and continue to improve the performance.
- 5.1. Linear Programming (LP)
- 5.2. Mixed Integer Linear Programming (MILP)
- 5.3. Quadratic Programming (QP)
- 5.4. Semidefinite Programming (SDP)
- 5.5. Analysis of constraint conflicts