Optimization, Linear Programming, Convex Optimization, Duality, Towards Data Science.
programming problem, optimal solution (if exists) can be found by the efficient Simplex algorithm. For problem (I), optimal solution is Simplex algorithm and some other optimization algorithms are iterative algorithms that, from a start point x₀, update x in each iteration through until the optimal