Lagrangian Duality: Optimization Tutorial

In course

Est non et nisi velit officia non consequat consequat irure voluptate. Sit voluptate laboris esse laboris cillum magna. Ad ea laboris mollit occaecat nostrud do est. Ipsum velit mollit aute officia duis pariatur ut ipsum ullamco cillum. Laboris amet ut consectetur dolore irure aliquip in nulla irure proident deserunt duis. Culpa Lorem do dolore sunt.

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

fugiat amet velit

Veniam laborum veniam eiusmod cillum est. Officia nulla amet adipisicing ea aute qui mollit commodo. Ea non ullamco laboris sint sit. Adipisicing ut tempor irure et irure reprehenderit officia proident Lorem mollit ipsum occaecat.

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)