Linear Programming 381 - LPR381
Linear Programming 381 - LPR381
Linear Programming 381 - LPR381
Purpose
Linear Programming is a scientific approach to decision making that seeks to best design and operate
a system, under conditions requiring the allocation of scarce resources. It is an interdisciplinary
mathematical science that focuses on the effective use of technology by organisations. In contrast,
many other science and engineering disciplines focus on technology, giving secondary considerations
to its use.
Outcomes
Upon successful completion of this module, the student will be able to:
Assessment
Assessment is performed using a variety of instruments:
P1-2
Linear Programming 381
Additional Material
Presentation notes and hand-outs from direct instruction and feedback sessions;
Introduction to Management Science – Taylor
Engineering Mathematics – K. A. Stroud
Operations Research - Wayne L Winston
Learning activities
The teaching is a combination between presentation of theoretical concepts and exercises and
discussions. It is dialogue-oriented with a practical approach, with mandatory assignment and
project which must be completed during the course.
Syllabus
Revised Simplex
Discrete programming
Simplex redux with Hungarian flair
Integer Programming
Branch and bound algorithms
Knapsack problems
The cutting plane algorithm
Traveling sales person problems
Machine scheduling problems
Nonlinear programming
P2-2