Complete Pyomo Bootcamp. Python Optimization From Beginner to Advance
- Description
- Curriculum
- Notice
- Reviews
In this course, you will learn how to deal with various types of mathematical optimization problems as below:
-
Linear Programming (LP)
-
Mixed Integer Linear Programming (MILP)
-
Non-Linear Programming
-
Mixed Integer Non-Linear Programming
Since this course is designed for all levels (from beginner to advanced), we start from the beginning that you need to formulate a problem. Therefore, after finishing this course, you will be able to find and formulate decision variables, objective function, constraints and define your parameters. Moreover, you will learn how to develop the formulated model in the Python environment (using the Pyomo package).
Here are some of the important skills that you will learn when using Python in this course:
-
Defining Sets & Parameters of the optimization model
-
Expressing the objective function and constraints as Python function
-
Import and read data from an external source (pdf file)
-
Solve the optimization problem using various solvers such as CPLEX, IPOPT, COUENNE &, etc.
- 43 Downloadable resources
In this course, we solve simple to complex optimization problems from various disciplines such as engineering, production management, scheduling, transportation, supply chain, and … areas.
This course is structured based on 3 examples for each of the main mathematical programming sections. In the first two examples, you will learn how to deal with that type of specific problem. Then you will be asked to challenge yourself by developing the challenge problem into the Python environment. Nevertheless, even the challenge problem will be explained and solved with details.
Who this course is for:
- Students in all levels (Undergrad, Grad and PhD)
- Companies Who Wants to Use Optimization in Their Businesses
- Professionals in Various disciplines such as Engineering, Management and Operation Research
- Anyone Who is Interested to Learn Optimization and Coding in Python!
-
89 - How to use the examples in this course
-
910 - Biggest rectangle inside a circle
-
1011 - Biggest cylinder inside a Sphere
-
1112 - Fastest route
-
1213 - Heron problem
-
1314 - Steiner problem.en
-
1415 - System of linear equations
-
1516 - Access to Dual values of Constraints
Consider the previous Lecture (System of linear equations)
-
1617 - Hostile brothers in a rectangle
-
1718 - Hostile brothers in a circle
-
1819 - Hostile brothers in a triangle
-
1920 - N-Queens
-
2021 - Circle placement in a rectangle
-
2122 - Circle placement in a circle
-
2223 - Circle placement in a half-circle
-
2324- Circle placement in a triangle
-
2425 - Biggest equal sized circles inside a unity circle
-
2526 - Clash of clans
-
2627 - Biggest circle on a surface with obstacles
-
2728 - Center of mass
-
2829 - Center of mass (negative mass)
-
2930 - Min Queens to cover the chess board
-
3031 - Connected tree
-
3132 - Spanning tree with degree constraints
-
3233 - Connected tour
-
3334 - Conference allocation
-
3435 - Max flow
-
3536 - Graph Node Coloring
-
3637 - Graph Edge Coloring
-
3738 - Facility allocation
-
3839 - Curve fitting
-
3940 - Paper company
-
4041 - Transportation