Scribd
Upload
64 views

Linear Programming 381 - LPR381

This document provides information on the Linear Programming 381 module. The module is an 11-credit, level 7 core module for Bachelor of Computing students. It focuses on teaching students to apply linear programming principles and techniques to best design systems and allocate scarce resources. Assessment includes continuous evaluation of assignments, tests, and a final written exam. Students will learn various linear programming topics through lectures, assignments, projects and additional reading materials. The syllabus covers revised simplex, integer programming, branch and bound algorithms, and other nonlinear programming topics.

Uploaded by

Andrew Strugnell
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
64 views

Linear Programming 381 - LPR381

This document provides information on the Linear Programming 381 module. The module is an 11-credit, level 7 core module for Bachelor of Computing students. It focuses on teaching students to apply linear programming principles and techniques to best design systems and allocate scarce resources. Assessment includes continuous evaluation of assignments, tests, and a final written exam. Students will learn various linear programming topics through lectures, assignments, projects and additional reading materials. The syllabus covers revised simplex, integer programming, branch and bound algorithms, and other nonlinear programming topics.

Uploaded by

Andrew Strugnell
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Linear Programming 381

Module: Linear Programming 381


Module name: Linear Programming 381
Code: LPR381
NQF level: 7
Type: Core – Bachelor of Computing (all streams)
Contact time: 48 hours
Structured time: 8 hours
Self-directed time: 54 hours
Notional hours: 110 hours
Credits: 11
Prerequisites: LPR281

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:

 Demonstrate integrated knowledge of the central areas of linear programming, including an


understanding of and the ability to apply and evaluate the key terms, concepts, facts,
principles, rules and theories of linear programming; and detailed knowledge of an area or
areas of specialisation and how that knowledge relates to other fields, disciplines or
practices.
 Demonstrate an understanding of knowledge as contested and the ability to evaluate types
of knowledge and explanations typical within linear programming.
 An understanding of a range of methods of enquiry in linear programming, and their
suitability to specific investigations; and the ability to select and apply a range of methods to
resolve problems or introduce change within a practice.
 The ability to identify, analyse, evaluate, critically reflect on and address complex problems,
applying evidence-based solutions and theory-driven arguments.
 The ability to develop appropriate processes of information gathering for a given context or
use; and the ability to independently validate the sources of information and evaluate and
manage the information.

Assessment
Assessment is performed using a variety of instruments:

 Continuous evaluation of theoretical work through written assignment, formative, and


summative test.
 Final assessment through a written examination.

P1-2
Linear Programming 381

Teaching and Learning


Learning materials
Prescribed Book
Linear Programming: Integer Programming – IT Without Frontiers.

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.

Notional learning hours

Activity Units Contact Time Structured Time Self-Directed Time


Lecture 40.0 21.0
Formative feedback 8.0
Project
Assignment 3 9.0
Test 3 6.0 11.0
Exam 1 2.0 13.0

48.0 8.0 54.0

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

You might also like