Get updates on Eligibility, Admission, Placements Fees Structure
Quick Facts
| Medium Of Instructions | Mode Of Learning | Mode Of Delivery |
|---|---|---|
| English | Self Study | Video and Text Based |
Course Overview
This fundamental course focuses on the mathematical approach to networks and optimization issues. This course is presented by edX, a popular online education medium along with the institution of Ecole Polytechnique Federale de Lausanne (EPFL), a top European institution for technology and science. This short intermediate course is provided with a flexible learning system and a comprehensive curriculum which will be under the experienced EPFL professor, Michel Bierlaire. The students can either go for a free audit session with limited benefits or a verified track session with complete Optimization: Principles and algorithms- Network and discrete optimization certification benefits.
The course mainly highlights five different sections: Transhipment, Discrete optimization, Shortest path, Exact methods for discrete optimization, and Networks which will be individually assessed and graded as well. Apart from these key concepts, the syllabus focuses on other important aspects such as modelling, the curse of dimensionality, total unimodularity, network representations, and so on. Two different tracks are available on edX which may be opted for by the students to complete the course. Both the tracks are self-paced but during the verified track, the candidates may access the course for a lifetime by paying some fee. To access the audit track, nothing is charged but the materials will only be accessible for a limited period.
The Highlights
- The course provided by edX
- Presented by EPFL institution
- The course duration of 5 weeks with 6-8 hours per week
- Verified and shareable certification
- Self-paced instructor-led online classes
- Free audit sessions for a limited period
- Intermediate course on math
Programme Offerings
- Instructor-led
- Practise Exercises
- Discussion Forums
- Online Classes
- Final examination
- & Video lectures
Courses and Certificate Fees
| Fees Informations | Certificate Availability | Certificate Providing Authority |
|---|---|---|
| USD 59 | yes | Swiss Federal Institute of Technology Lausanne |
Optimization Principles and Algorithms Network and Discrete Optimization Fees Structure :
| Fees components | Amount |
| Audit | Nil |
| Certificate | $59 USD |
Eligibility Criteria
Education
Students are assumed to have prior knowledge in linear optimization and are advised to follow the companion course if they are unfamiliar with this concept. Also, programming skills with python language are encouraged since it would make the learning process easier. It's not a mandatory requirement.
Certification qualifying details
The students will only be provided with the certificate of completion if they have become a verified track user after the necessary payments. Students should meet a grade requirement of 60% or above in the final grade based on the final examinations.
What you will learn
The course is designed to give students a plethora of learning outcomes focused on various skills such as the following:
- Students are taught how to deal with various networks with a detailed study of the mathematical formalism of networks and graphs under the Optimization: Principles and algorithms- Network and discrete optimization programme.
- Students are given a comprehensive account of Transhipment problems or minimum cost flow problems as a part of the Optimization: Principles and algorithms- Network and discrete optimization training.
- The different transhipment properties along with special instances are provided to the students to give a conclusive account on the topic.
- Students are trained in different algorithms to easily find the shortest path in a network.
- Students are given the training to specify and isolate a discrete optimization problem.
- Students are trained to find ideal methods for combating discrete optimization problems through two sets of algorithms to solve the problems Optimization: Principles and algorithms- Network and discrete optimization training.
- Students are given a brief and coherent account on the mathematical concept of networks Optimization: Principles and algorithms- Network and discrete optimization online course.
- The modelling power of discrete optimization is taught to the students in detail along with reference to classical issues.
- Different algorithms such as branch and bound algorithms are taught with examples along with the concept of cuts with Optimization: Principles and algorithms- Network and discrete optimization programme.
- Students are trained to have a mathematical approach and intuitions to allow a thorough understanding of key concepts on optimization.
Who it is for
The following students can apply for this course:
- Aspirants who have a keen interest to learn the fundamentals of networks and discrete optimization.
- Students who wish to build an impeccable career in this field with knowledge of python programming.
Admission Details
The intermediate course provides the learners an easy and quick online registration process within a few clicks.
The following steps can be adopted by the learners in order to register in the course:
Step: 1- Browse the course website with the URL provided - https://www.edx.org/learn/math/ecole-polytechnique-federale-de-lausanne-optimization-principles-and-algorithms-network-and-discrete-optimization
Step: 2- Sign up on the edX website using any one of your social media accounts or creating a new account and complete email verification of the ID you provided by clicking the confirmation link sent to the same ID.
Step: 3- Enrol in the desired course and you will be directed to a page confirming your enrolment and to select whether you want to go for direct payment or continue auditing.
Step: 4- click on the option, purchase the verified track if you wish to go for direct upgrading. After choosing, proceed to Optimization: Principles and algorithms- Network and discrete optimization training fee payment.
Step: 5- Become a verified track user after completing the payment using any of the given payment options.
Application Details
The Syllabus
- You will be introduced to the mathematical formalism of graphs and networks.
- You will learn about the transhipment problem (also called "minimum cost flow problem"), its properties, and some special instances.
- You will learn about algorithms to find the shortest path in a network.
- You will learn how to specify a discrete optimization problem.
- You will be introduced to two algorithms to solve discrete optimization problems.