Jordan University of Science and Technology

Department of Mathematics and Statistics

Math 371 (Linear Programming and its Applications)

 

Semester: Summer, 2005/2006 Prerequisite: Math 240
Dr. Mahmoud Alrefaei Office Hours: 10:30 - 11:30 daily

Course Objectives: Linear programming is about making the most of limited resources. Specifically, it deals with maximizing a linear function of variables subject to linear constraints. Applications range from economic planning and environmental management to the diet problem. The aim is to provide a simple introduction to the subject.

Grading Policy:

FirstExam:
Wednesday 12/7
25 %
Second Exam:
Wednesday 2/8
25 %
Assignments and Quizzes
10 %
Final
40 %
Total
100 %

Text Book: Winston W. L. Operations Research Applications and Algorithms, 4th edition Chapters: 3-8. Duxbury Press (2004).

References:

  1. D. G. LUENBERGER, Linear and Nonlinear Programming, Addison-Wesley (1984).
  2. F. S. HILLIER, G. J. LIEBERMAN, Introduction to Operations Research, 7th Edition. McGraw-Hill (2001).

Syllabus:

Week Chapter Content
1 1 Introduction to O.R. and Model-Building
3.1 Linear Programming Models
3.2, 3.3 Graphical Solution of Linear Programs
4.17 Using the Excel Solver, (In the Math lab in M1)
2 3.4 - 3.8 Real Life Examples
4.1 - 4.8 The Simplex Method
4.9, 4.10 Computer Packages (LINDO, LINGO) (In the Math lab in M1),
3 4.11, 4.12 Degeneracy, The Big M Method
First Exam: Wednesday July 12
4 4.13, 4.14 Two Phase Simplex Method , Unrestricted-in-sign Variables
4.16 Goal Programming
5 6 Sensitivity Analysis and Duality  Lecture Note
6 7 Transportation, Assignment, and
Transshipment Problems
Second Exam: Wednesday August 2
7 8 Network Models

File translated from TEX by TTH, version 2.51.
On 23 June 2006, 11:35.