Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Lecture
Linear Programming Basics
Description
This lecture introduces the basics of linear programming, focusing on defining corners, extreme points, and feasible solutions within polyhedrons. It covers the standard form of equality and inequality constraints, adding slack variables, and determining extreme points. The instructor explains the concept of basic feasible solutions and the uniqueness of extreme points in polyhedrons.
Official source
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.