Print

COURSE INFORMATION
Course CodeCourse TitleL+P HourSemesterECTS
MAT 528OPTIMIZATION METHODS I3 + 01st Semester7,5

COURSE DESCRIPTION
Course Level Doctorate Degree
Course Type Elective
Course Objective To teach the basic concepts of optimization and linear programming methods
Course Content General Linear Programming Problem, Dualty at Linear Programming, Species of Dual Problem, Fundamental Linear Programming Problem and Solution with Simplex Method, Minimum of Linear Programming Problem, Simplex Algorithm, Finding Integer Solution Method at Linear Programming, Distribution Problems and Methods for Their Solution.
Prerequisites No the prerequisite of lesson.
Corequisite No the corequisite of lesson.
Mode of Delivery Face to Face

COURSE LEARNING OUTCOMES
1Learns the General Linear Programming Problem.
2Knows the Dualty at Linear Programming, Species of Dual Problem.
3Knows the Fundamental Linear Programming Problem and Solution with Simplex Method.
4Learns the Minimum of Linear Programming Problem, Simplex Algorithm, Finding Integer Solution Method at Linear Programming.
5Learns the Distribution Problems and Methods for Their Solution.

COURSE'S CONTRIBUTION TO PROGRAM
Data not found.

ECTS ALLOCATED BASED ON STUDENT WORKLOAD BY THE COURSE DESCRIPTION
ActivitiesQuantityDuration (Hour)Total Work Load (Hour)
Course Duration (14 weeks/theoric+practical)14342
Hours for off-the-classroom study (Pre-study, practice)14798
Assignments155
Mid-terms11515
Final examination13535
Total Work Load

ECTS Credit of the Course






195

7,5
COURSE DETAILS
 Select Year   


This course is not available in selected semester.


Print

L+P: Lecture and Practice
PQ: Program Learning Outcomes
LO: Course Learning Outcomes