MATH 3841 - Linear Programming

Units: 4
Problems of maximizing or minimizing a linear function subject to linear constraints; typical applications involve planning (“programming”) the allocation of limited resources to achieve an optimal result. Topics include problem formulation, solution procedures, duality theory, sensitivity analysis, special problems (e.g., transportation and assignment problems). Prerequisites: MATH 2304 and competence in matrix algebra.