Zarqa University
Faculty of Science
Department: Mathematics
Course title: Mathematical Programming
Course number: 0301306
Instructor: Dr. Qasem Qadumi
Lecture’s time: 9-10 S, Tu, Th.
Semester: First 2015
Office Hours: 10-11 S, Tu, Th.
Course description:
In this course we study some problems and using different ways for solving such problems. The first
way is graphical (or two face) way, Simplex method, duality, sensitivity for the solutions. Finally we
study transportation way for solving transportation problems.
Aims of the course: Mathematical Programming is one of the major branches of mathematics, this
one-semester three-credit course will have three general interconnected objectives.
1. will provide a firm foundation in Mathematical Programming to enable the student to continue more
advanced study in this area
2. This course will present and emphasize many topics in mathematics, in particular algebra, in order
to aid the student in his future mathematical studies
3. This course hopes to expose the students to both mathematical rigor and abstraction, giving there
an opportunity further to develop his mathematical maturity
Intended Learning Outcomes: (ILOs)
A.
Knowledge and Understanding
A1. Concepts and Theories:
Define and illustrate the concept of Mathematical Programming.
A2. Contemporary Trends, Problems and Research:
Serve to understanding topics in mathematics
A3. Professional Responsibility:
To prepare freshmen for higher level courses in mathematics , computer science and engineering.
B.
Subject-specific skills
B1. Problem solving skills:
Solve problems and using different ways for solving such problems.
B2. Modeling and Design:
Solve related problems.
B3. Application of Methods and Tools:. using different ways for solving such problems.
C.
Critical-Thinking Skills
C1. Analytic skills: Assess
study some problems and using different ways for solving such problems
C2. Strategic Thinking:
Using different ways for solving particular problems.
C3. Creative thinking and innovation:
ZU/QP07F018
01 :‫اإلصدار‬
2015 ‫ حزيران‬24 :‫تاريخ اإلصدار‬
D.
General and Transferable Skills (other skills relevant to employability and personal development)
D1. Communication:
D2. Teamwork and Leadership:
Course structures:
Credit
Week
ILOs
Hours
Topics

Teaching Procedure
Assessment
methods
What is Linear Programming
Problem

1
3
A1, A2,
B1, B2
Examples on the application of
Lectures, Cooperative
learning and
The Graphical solution of Two- discussion
Variable Linear Programming
Linear Programming

Exams and
Homework’s
Problem

Additional Examples.

How to convert a LP to
Standard Form
2
3
A1, A2,
B1, B2,
C1

Lectures, Cooperative
Using the Simplex Algorithms learning and
to
solve
Minimization discussion
Exams and
Homework’s
Problems
3
4
5
6
3
3
A1, A2,
B1, B2

Alternating Optional Solution

Unbounded LPs

Degeneracy

convergence of the Simplex Lectures, Cooperative
learning and
Algorithms
discussion
Finding a Feasible solution

The big M Method
A1, A2,
B1, B2,
C1
3
A1, , B1
3
A1, A2,
B1, B2




7
3
A1, A2,
B1, B2

and
Lectures, Cooperative
learning and
discussion
the
Lectures, Cooperative
learning and
The two phase method
discussion
Unrestricted In – Sign variables Lectures, Cooperative
learning and
First exam
discussion
A Graphical Introduction to
Lectures, Cooperative
Sensitivity Analysis
learning and
discussion
Some Important Formulas
ZU/QP07F018
Exams and
Homework’s
01 :‫اإلصدار‬
Exams and
Homework’s
Exams and
Homework’s
Exams and
Homework’s
Exams and
Homework’s
2015 ‫ حزيران‬24 :‫تاريخ اإلصدار‬

8
3
9
3
10
11
A1, A2,
B1, B2,
C1, C2
A1, A2,
B1, B2,
C1, C2
3
A1, A2,
B1, B2,
C1, C2
3
A1, A2,
B1, B2,
C1, C2
3
3
A1, A2,
B1, B2
14
3
A1, A2,
B1, B2,
C1, C2
Exams and
Homework’s
Lectures, Cooperative
learning and
discussion
Exams and
Homework’s
Lectures, Cooperative
learning and
discussion
Exams and
Homework’s
Lectures, Cooperative
Transportation learning and
discussion
Exams and
Homework’s

Finding the Dual of a LP

The Dual Theorem and its
Consequences

Complementary Slackness

The Dual Simplex Method

Second exam

Formulation
Problems
A1, A2,
B1, B2,
C1, C2
13
Lectures, Cooperative
learning and
discussion
than one parameter is changed

12
Sensitivity Analysis when more
Finding Basic Feasible solution
(BFS)
for
Problems


Lectures, Cooperative
Transportation learning and
discussion
Simplex Lectures, Cooperative
learning and
Method
discussion
Lectures, Cooperative
Assignment Problems
learning and
discussion
The
Transportation
Exams and
Homework’s
Exams and
Homework’s
Exams and
Homework’s
Final Exams
16
References:
A.
Main Textbook:
Introduction to mathematical programming, W. L. Winston.
B.
Supplementary Textbook(s):
1) Essential of Linear Programming by Jit S. Chandam & Others
2) Linear Programming by Ronal I. Rothenberg.
3) An Introduction to Linear programming and Game Theory by Paul R. Thie.
Assessment Methods:
Methods
First exam
Second exam
Final exam
Grade
25
25
50
ZU/QP07F018
Date
08 / 11 / 2015
13 / 12 / 2015
17-28 / 01 /2015
01 :‫اإلصدار‬
2015 ‫ حزيران‬24 :‫تاريخ اإلصدار‬