Faculty of Science

Model (No 12)

Course Specification : برمجة - تحليل عددى

2008 - 2009

 
Farabi Quality Management of Education and Learning - 23/11/2024
University :Mansoura University
Faculty :Faculty of Science
Department :Mathematics Department
1- Course data :-
Code: 11402
Course title: برمجة - تحليل عددى
Year/Level: رابعة رياضيات
Program Title:
  • Mathematics
Specialization:
Teaching Hours: Theoretical: 4Tutorial: 2Practical:
2- Course aims :-
  1. At the end of this course the successful student will understand the mathematics of linear programming, the importance of linear programming applications, and will be able to formulate and solve and analyze small linear programmes by hand and with computer software.
3- Course Learning Outcomes :-
4- Course contents :-
NoTopicsWeek
1Introduction
2Convex analysis
3Minimization of a convex function
4Formulation of linear programming models Graphical solution
5The Simplex Algorithm, Two-Phase Simplex
6Duality in linear programming problems and Dual Simplex
7Simplex method in Matrix notations
8Linear programming applications

5- Teaching and learning methods :-
SMethod
Lectures
Tutorials

6- Teaching and learning methods of disables :-
    No data found.

7- Student assessment :-
A. Timing
NoMethodWeek
1Mid term exam14
2sheet exam and Oral exam 15
3final exam
B. Degree
NoMethodDegree
1Mid_term examination0
2Final_term examination90
3Oral examination 10
4Practical examination 0
5Semester work0
6Other types of asessment0
Total100%

8- List of books and references
SItemType
1 Course Notes :
2 Essential Books (Text book): Linear Programming: Foundations and Extensions, by Robert Vanderbei, Kluwer, 1997 (strongly recommended).
3 Recommended Book: 1- J.P. Ignizio and T.M. Cavalier, “Linear Programming”, Prentice-Hall, 1994. 2.2-Theory of Linear and Integer Programming, by Alexander Schrijver, Wiley, 1986
4Periodicals, Web Sites, ....etc: http://www.princeton.edu/~rvdb/LPbook/index.html

9- Matrix of knowledge and skills of the course
SContentStudy week
Introduction
Convex analysis
Minimization of a convex function
Formulation of linear programming models Graphical solution
The Simplex Algorithm, Two-Phase Simplex
Duality in linear programming problems and Dual Simplex
Simplex method in Matrix notations
Linear programming applications

Course Coordinator(s): -
  1. Elsaid Mohamed Elsaid Ahmed
Head of department: -
Ahmed Habeb Mohamed Nageb Elbassiony