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

In recent years, several condition numbers were defined for a variety of linear programming problems based upon relative distances to ill-posedness. In this paper, we provide a unifying view of some ...

George B. Dantzig, the mathematician who invented the field of linear programming, which revolutionized the way government and private enterprise planned, scheduled and generally conducted their ...

SIAM Journal on Numerical Analysis, Vol. 13, No. 1 (Mar., 1976), pp. 145-154 (10 pages) A numerically stable form of an algorithm that is closely related to the work of Gill and Murray [5] and Conn [3 ...

Roth, A. E., U. G. Rothblum, and J. H. Vande Vate. "Stable Matchings, Optimal Assignments, and Linear Programming." Mathematics of Operations Research 18, no. 4 ...

Linear semi-infinite programming (LSIP) is a branch of optimisation that focuses on problems where a finite number of decision variables is subject to infinitely many linear constraints. This ...