All Products
Search
Document Center

Optimization Solver:Learning path for beginners

Last Updated:Aug 16, 2023

For beginners who are unfamiliar with Optimization Solver, you can use the following learning path to learn and use Optimization Solver.

If you are a beginner, we recommend that you use the following learning path to quickly understand what Optimization Solver can do and use cases to learn the concepts of Optimization Solver and learn how to develop applications.

Learning path for beginners

Step 1: Learn the concepts and cases of Optimization Solver

Quickly browse What is Optimization Solver? and Cases topics to learn what is Optimization Solver used for and what problems Optimization Solver can solve.

Step 2: Activate the Optimization Solver service

Activate and purchase the Optimization Solver service. Then, download and install Optimization Solver. For more information about how to activate and purchase the service, see Activate and use the service. The service is free of charge. When you purchase the service, the billing amount is 0. For more information about how to install and run Optimization Solver, see Concept of Optimization Solver.

Step 3: Follow cases to learn Optimization Solver

Multiple cases and various data are stored in the examples folder of the MindOpt installation directory. You can directly run the code in the examples folder to obtain results. You can go to the Cases: Linear Programming (LP) topic to learn the concept of linear programming. Then, select sample code in a programming language that you are interested in, view modeling solution analysis of business issues, and then run source code to obtain results. You can also visit the MindOpt platform in invitational preview to learn how to use algebraic modeling languages to call Optimization Solver. The algebraic modeling languages are easy to use.

Step 4: Develop advanced applications

For more information about APIs, see User Manual of Optimization Solver. You can develop applications based on your business requirements.