OA3201 Linear Programming

(Same as MA3301.) Theory of optimization of linear functions subject to linear constraints. The simplex algorithm, duality, sensitivity analyses, parametric linear programming. Applications to resource allocation, manpower planning, transportation and communications, network models, ship scheduling, etc. Introduction to computer-based linear programming systems.

Prerequisite

MA3042

Lecture Hours

4

Lab Hours

0

Course Learning Outcomes

Upon successful completion of this course you will be able to:
• Read and understand mathematical models that are properly formulated and documented.
• Formulate your own linear and mixed-integer models (with applications to real-world problems) from word descriptions.
• Understand the step-by-step processes involved in solving these problems.
• Implement some of these problems computationally using Pyhon-Pyomo, and understand their solutions