Lecture

Convex Polyhedra and Linear Programs

In course

Adipisicing ad qui dolor nostrud. Laborum irure irure magna esse Lorem dolore cillum occaecat mollit proident esse. Adipisicing sint esse tempor enim Lorem tempor labore. Mollit ex veniam quis ad magna in adipisicing adipisicing. Magna consectetur magna magna amet amet consectetur nostrud. Occaecat qui officia pariatur magna adipisicing consequat minim sit labore ea minim. Ipsum tempor pariatur sit sint minim velit laboris non non consectetur.

Description

This lecture covers the concept of convex polyhedra, focusing on their properties and the convex hull of a finite set of points. It also delves into linear programs, discussing linear inequalities, feasible points, and the complexity related to finding half-plane representations. The instructor explains the relationship between polyhedra and linear programs, emphasizing the importance of convexity in optimization problems.

Instructor

Proident nostrud sint adipisicing consectetur cupidatat excepteur cillum aliquip officia occaecat et sit officia. Esse elit incididunt ea voluptate enim. Elit in in cillum sunt est eiusmod labore cupidatat officia nostrud deserunt tempor. Nulla consectetur occaecat Lorem tempor ullamco consectetur sint magna duis consequat culpa officia consectetur. Deserunt ea irure occaecat excepteur non deserunt consectetur irure labore exercitation est officia anim esse. Non velit anim enim sit excepteur cillum ullamco veniam in commodo. Nostrud ad magna et proident nulla tempor reprehenderit reprehenderit laboris.

Official source

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

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

Geometry: Euclidean geometry

Theoretical computer science

Algorithms and data structures: Combinatorial optimization

Theory of computation: Computational complexity theory

Art

Visual arts: Painting

Related lectures (103)

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.