In this video, we explore the theoretical foundations associated to linear programming and the algorithms associated with solutions of linear programs. In particular, we discuss closed half spaces, convex sets, convex combinations, extreme points of feasible sets, the resolution theorem, and the fundamental theorem of linear programming.
*--The Let's Learn, Nemo Community--*
►YouTube – https://www.youtube.com/LetsLearnNemo
►Discord – https://discord.gg/JjdmSma
►Twitch – https://www.twitch.tv/LetsLearnNemo
►Patreon - https://www.patreon.com/LetsLearnNemo
►Website – https://www.LetsLearnNemo.org
#LetsLearnNemo #LinearProgramming #Optimization
