闪播福利库

A precise treatment of linear programming. Theory of convex sets, linear inequalities; development of the simplex method; duality theory; post optimality application and interpretation. Variants of the simplex methods and interior-point algorithms are discussed. Prerequisite: 滨狈贰骋听56103. (Typically offered: Fall)