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: On successful completion of this course, students will be able to: 1. Demonstrate linear models from a given problem and utilize geometrical methods to solve a two-variable problem. 2. Demonstrate knowledge of the constraint set. 3. Use simplex, dual simplex and the primal-dual methods to solve the Linear Programming Problem. 4. Analyse the solution to the problem for sensitivity. 5. Provide solutions to transportation, Tran-shipment and assignment problems.

Prerequisite: Completion of any 600 level MTH course.

Prerequisite Sentence: N/A

Credit Point: 15

Offered In: Semester 2