Unit Code: MTH712

Unit Name: Linear programming

Description: This course focuses on a class of problems that can be modelled as a linear programming model. Formally, a linear programming model is either minimization or maximization of a linear function of several variables constrained with linear inequalities. Surprisingly, a large number of decision problems fit into this framework. This explains why linear programming is so widely used in a variety of industries, ranging from transportation to health care, and from finance to manufacturing. This methodologies development will include the simplex algorithm, theorem of duality, complementary slackness, sensitivity analysis network flows, and network simplex.

Learning Target Outcomes:

Prerequisite: Completion of any 600 level MTH course.

Prerequisite Sentence: N/A

Credit Point: 15

Offered In: Semester 2