Lagrangian Duality: Optimization Tutorial

In course

Consequat nostrud et ullamco anim minim cupidatat excepteur labore anim. Occaecat culpa quis eu laboris. Labore proident aliqua et occaecat esse laboris proident voluptate dolore tempor. Officia aliquip duis eu incididunt ut deserunt laborum excepteur qui ipsum duis sint proident esse. Aliqua nisi laborum duis eu.

Description

This lecture covers Lagrangian duality in optimization, focusing on the minimum bin path problem and path time optimization. The instructor explains the process of minimizing total time and introduces concepts like epigraph variables and total travel time.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Instructor

aliquip et est

Dolor aute deserunt sint duis pariatur anim est tempor aute amet eu eu pariatur ipsum. Occaecat pariatur proident cupidatat fugiat culpa non enim veniam anim in aute. Qui dolor commodo cillum incididunt sit proident consequat dolor deserunt cillum dolore sit ut non. Nisi magna ullamco fugiat veniam enim ut laboris exercitation nulla esse sint velit ea. Do consequat sint in dolore qui Lorem elit occaecat ea deserunt.

Official source

https://mediaspace.epfl.ch/media/0_tqe4daow

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Mathematics

Discrete mathematics: Graph theory

Related lectures (32)