Lecture

Linear Constraints: Polyhedron

Description

This lecture focuses on linear constraints, defining a polyhedron as the intersection of half-spaces represented by linear inequalities. It explains the convex property of a polyhedron, different ways to represent it, and the transformation between canonical and standard forms.

In MOOCs (6)

Instructor

veniam dolore in elit

Ex laboris anim mollit magna fugiat proident. Nisi voluptate ad id duis. Ad aliquip mollit incididunt elit laborum commodo proident eiusmod et culpa do excepteur ut. Excepteur cillum minim consectetur aute pariatur deserunt et fugiat ipsum id aute non adipisicing duis. Et occaecat proident ipsum amet sit pariatur aliqua. Ullamco irure irure ad quis labore proident. Quis duis id excepteur enim irure pariatur cupidatat sit deserunt cupidatat sunt.

Official source

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

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

Theoretical computer science

Algorithms and data structures: Combinatorial optimization

Related lectures (65)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.