Roughly, we will cover the following topics (some of them may be skipped depending on the time available). Linear Programming: Basics, Simplex Algorithm, and Duality. Applications of Linear ...

Abstract: In this work, we extend the simplex algorithm of linear programming for finding a local minimum of a concave quadratic function subject to box constraints. In order to test the performance ...