This is a preview. Log in through your library . Abstract A computational procedure based on the results of Barankin and Dorfman [1], for minimising a convex quadratic function subject to linear ...

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