Lecture

Linear Programming Basics

Description

This lecture provides a detailed explanation on how to derive the basic representation of a linear program in standard form, find the corresponding basic solutions, and determine if they are optimal. It also covers the concept of basic directions for non-basic variables with negative reduced costs and how to verify if the current basic feasible solution can be improved. Additionally, it explores the calculation of the number of possible basic solutions for a standard linear program with a large number of variables and constraints. The lecture concludes with a discussion on the properties relating reduced costs and optimality in linear programming.

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
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.

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.