Скачать или смотреть Lecture 5 | Linear Programming & SIMPLEX algorithm w MATLAB | Convex Optimization

☕️ Buy me a coffee: https://paypal.me/donationlink240
🙏🏻 Support me on Patreon:   / ahmadbazzi  

In Lecture 5 of this course on convex optimization, we will be covering Linear Programming and the Simplex algorithm, which was introduced by George Dantzig. The outline of the lecture is as follows:

00:00:00 What is a Linear Program (LP) ?
00:07:24 LP feasible set
00:10:22 LP forms
00:10:50 Standard form LP
00:10:50 Standard form LP
00:11:24 Slack variables
00:13:08 Inequality form LP
00:13:34 Omitting inequality constraints
00:20:38 LP Example: The Diet Problem
00:25:49 The SIMPLEX Algorithm: Method and the usage of Non-basic, Slack, and Artificial variables
00:33:59 The SIMPLEX Algorithm - Example: Iteration 0
00:40:37 The SIMPLEX Algorithm - Example: Iteration 1
00:48:18 The SIMPLEX Algorithm - Example: Iteration 2
00:55:27 The SIMPLEX Algorithm - Example: Iteration 3
01:00:13 MATLAB: Implementing SIMPLEX
01:53:15 MATLAB: Verifying with linprog
01:58:48 George Bernard Dantzig
01:59:12 SIMPLEX: Geometric Interpretation
02:01:09 SIMPLEX: Time Complexity

---------------------------------------------------------------------------------------------------------
Code: https://github.com/therealbazzi/simplex
---------------------------------------------------------------------------------------------------------

Lecture 1 | Introduction to Convex Optimization:    • Lecture 1 | Convex Optimization | Introduc...  
Lecture 2 | Convex Sets:    • Lecture 2 | Convex Sets | Convex Optimizat...  
Lecture 3 | Convex Functions:    • Lecture 3 | Convex Functions | Convex Opti...  
Lecture 4 | Convex Optimization Principles :    • Lecture 4 | Convex Optimization Principles...  
---------------------------------------------------------------------------------------------------------
References:
[1] Boyd, Stephen, and Lieven Vandenberghe. Convex optimization. Cambridge university press, 2004.
[2] Nesterov, Yurii. Introductory lectures on convex optimization: A basic course. Vol. 87. Springer Science & Business Media, 2013.
Reference no. 3:
[3] Ben-Tal, Ahron, and Arkadi Nemirovski. Lectures on modern convex optimization: analysis, algorithms, and engineering applications. Vol. 2. Siam, 2001.
---------------------------------------------------------------------------------------------------------
Instructor: Dr. Ahmad Bazzi
IG:   / drahmadbazzi  
FB: https://www.facebook.com/profile.php?...
RG: https://www.researchgate.net/profile/...
MSE: https://math.stackexchange.com/users/...
YT:    / ahmadbazzi  
---------------------------------------------------------------------------------------------------------
Credits :
Microsoft OneNote: https://products.office.com/en-gb/one...
MATLAB: https://www.mathworks.com/products/ma...

Linear P; lp solver; feasible region in linear programming; slack variable;

#ConvexOptimization #Linear #Program