Course Detail
Course Detail
Course Description
| Course | Code | Semester | T+P (Hour) | Credit | ECTS |
|---|---|---|---|---|---|
| NETWORK FLOWS and INTEGER PROGRAMMING | IND3149140 | Fall Semester | 3+0 | 3 | 6 |
| Course Program |
| Prerequisites Courses | |
| Recommended Elective Courses |
| Language of Course | English |
| Course Level | First Cycle (Bachelor's Degree) |
| Course Type | Required |
| Course Coordinator | Assoc.Prof. Yasin GÖÇGÜN |
| Name of Lecturer(s) | Assoc.Prof. Yasin GÖÇGÜN |
| Assistant(s) | |
| Aim | The students who succeeded the course will be able to identify and formulate Network problems; be able to identify and formulate Integer Programming problems; acquire basic skills to formulate and build integer and nonlinear programming models, and select and implement appropriate solution techniques. |
| Course Content | This course contains; A review of basic LP and introduction to Network Models, Transportation and transshipment models,Assignment models,Spanning tree Problems-Prim’s algorithm, Kruskal’s algorithm,Shortest Path Problems,Maximum Flow Problems Ford-Fulkerson Algorithm,,Multicommondity Flow, and network synthesis problems,Introduction to Integer Programming,Formulating Integer Programming Problems,Formulating (Mixed) Integer Programming Problems,Solving Integer Programming Problems- branch and bound method and cutting plane algorithm ,Dynamic Programming-1,Dynamic programming -2,Review. |
| Course Learning Outcomes | Teaching Methods | Assessment Methods |
| Students build transportation models | 12, 13, 14, 6, 8, 9 | A, E, G |
| Students build transshipment models. | 12, 13, 14, 6, 8, 9 | A, G |
| Students build assignment models. | 12, 13, 14, 6, 8, 9 | A, E |
| Students build network models using appropriate algorithms. | 12, 13, 14, 6, 8, 9 | E, G |
| Students solve integer programming models using appropriate algorithms | 12, 13, 14, 19, 6, 8, 9 | A, E, G |
| Students solve mathematical models using mathematical programming software. | 12, 13, 14, 16, 6, 8, 9 | A, E, G |
| Teaching Methods: | 12: Problem Solving Method, 13: Case Study Method, 14: Self Study Method, 16: Question - Answer Technique, 19: Brainstorming Technique, 6: Experiential Learning, 8: Flipped Classroom Learning, 9: Lecture Method |
| Assessment Methods: | A: Traditional Written Exam, E: Homework, G: Quiz |
Course Outline
| Order | Subjects | Preliminary Work |
|---|---|---|
| 1 | A review of basic LP and introduction to Network Models | |
| 2 | Transportation and transshipment models | |
| 3 | Assignment models | |
| 4 | Spanning tree Problems-Prim’s algorithm, Kruskal’s algorithm | |
| 5 | Shortest Path Problems | |
| 6 | Maximum Flow Problems Ford-Fulkerson Algorithm, | |
| 7 | Multicommondity Flow, and network synthesis problems | |
| 8 | Introduction to Integer Programming | |
| 9 | Formulating Integer Programming Problems | |
| 10 | Formulating (Mixed) Integer Programming Problems | |
| 11 | Solving Integer Programming Problems- branch and bound method and cutting plane algorithm | |
| 12 | Dynamic Programming-1 | |
| 13 | Dynamic programming -2 | |
| 14 | Review |
| Resources |
| Taha, Hamdy A., Operations Research, 8th edition, 2007. ISBN: 0131360140; Bazaraa M.S., Jarvis J.J., Sherali H.D., Linear Programming and Network Flows, 3 th Edition, ISBN 978-0-470-46272-0 |
| Ahuja R.K., Magnanti T.L., Orlin B.J.; Network Flows Theory, Algorithms, and Applications, Prentice Hall. ISBN-13: 978-0136175490 Winston, Wayne L., Operations Research: Applications and Algorithms, 4th edition, 2003. ISBN-13: 978-0534380588 |
Course Contribution to Program Qualifications
| Course Contribution to Program Qualifications | |||||||
| No | Program Qualification | Contribution Level | |||||
| 1 | 2 | 3 | 4 | 5 | |||
| 1 | Adequate knowledge in mathematics, science and engineering subjects pertaining to the relevant discipline; ability to use theoretical and applied knowledge in these areas in the solution of complex engineering problems. | X | |||||
| 2 | Ability to formulate, and solve complex engineering problems; ability to select and apply proper analysis and modeling methods for this purpose. | X | |||||
| 3 | Ability to design a complex system, process, device or product under realistic constraints and conditions, in such a way as to meet the desired result; ability to apply modern design methods for this purpose. | X | |||||
| 4 | Ability to select and use modern techniques and tools needed for analyzing and solving complex problems encountered in engineering practice; ability to employ information technologies effectively. | X | |||||
| 5 | Ability to design and conduct experiments, gather data, analyze and interpret results for investigating complex engineering problems or discipline specific research questions. | X | |||||
| 6 | Ability to work efficiently in intra-disciplinary and multi-disciplinary teams; ability to work individually. | X | |||||
| 7 | Ability to communicate effectively, both orally and in writing; knowledge of a minimum of one foreign language; ability to write effective reports and comprehend written reports, prepare design and production reports, make effective presentations, and give and receive clear and intelligible instructions. | X | |||||
| 8 | Awareness of the need for lifelong learning; ability to access information, to follow developments in science and technology, and to continue to educate him/herself. | X | |||||
| 9 | Knowledge on behavior according ethical principles, professional and ethical responsibility and standards used in engineering practices. | X | |||||
| 10 | Knowledge about business life practices such as project management, risk management, and change management; awareness in entrepreneurship, innovation; knowledge about sustainable development. | X | |||||
| 11 | Knowledge about the global and social effects of engineering practices on health, environment, and safety, and contemporary issues of the century reflected into the field of engineering; awareness of the legal consequences of engineering solutions. | X | |||||
Assessment Methods
| Contribution Level | Absolute Evaluation | |
| Rate of Midterm Exam to Success | 30 | |
| Rate of Final Exam to Success | 70 | |
| Total | 100 | |
| ECTS / Workload Table | ||||||
| Activities | Number of | Duration(Hour) | Total Workload(Hour) | |||
| Course Hours | 14 | 3 | 42 | |||
| Guided Problem Solving | 0 | 0 | 0 | |||
| Resolution of Homework Problems and Submission as a Report | 14 | 1 | 14 | |||
| Term Project | 0 | 0 | 0 | |||
| Presentation of Project / Seminar | 0 | 0 | 0 | |||
| Quiz | 5 | 10 | 50 | |||
| Midterm Exam | 1 | 30 | 30 | |||
| General Exam | 1 | 44 | 44 | |||
| Performance Task, Maintenance Plan | 0 | 0 | 0 | |||
| Total Workload(Hour) | 180 | |||||
| Dersin AKTS Kredisi = Toplam İş Yükü (Saat)/30*=(180/30) | 6 | |||||
| ECTS of the course: 30 hours of work is counted as 1 ECTS credit. | ||||||
Detail Informations of the Course
Course Description
| Course | Code | Semester | T+P (Hour) | Credit | ECTS |
|---|---|---|---|---|---|
| NETWORK FLOWS and INTEGER PROGRAMMING | IND3149140 | Fall Semester | 3+0 | 3 | 6 |
| Course Program |
| Prerequisites Courses | |
| Recommended Elective Courses |
| Language of Course | English |
| Course Level | First Cycle (Bachelor's Degree) |
| Course Type | Required |
| Course Coordinator | Assoc.Prof. Yasin GÖÇGÜN |
| Name of Lecturer(s) | Assoc.Prof. Yasin GÖÇGÜN |
| Assistant(s) | |
| Aim | The students who succeeded the course will be able to identify and formulate Network problems; be able to identify and formulate Integer Programming problems; acquire basic skills to formulate and build integer and nonlinear programming models, and select and implement appropriate solution techniques. |
| Course Content | This course contains; A review of basic LP and introduction to Network Models, Transportation and transshipment models,Assignment models,Spanning tree Problems-Prim’s algorithm, Kruskal’s algorithm,Shortest Path Problems,Maximum Flow Problems Ford-Fulkerson Algorithm,,Multicommondity Flow, and network synthesis problems,Introduction to Integer Programming,Formulating Integer Programming Problems,Formulating (Mixed) Integer Programming Problems,Solving Integer Programming Problems- branch and bound method and cutting plane algorithm ,Dynamic Programming-1,Dynamic programming -2,Review. |
| Course Learning Outcomes | Teaching Methods | Assessment Methods |
| Students build transportation models | 12, 13, 14, 6, 8, 9 | A, E, G |
| Students build transshipment models. | 12, 13, 14, 6, 8, 9 | A, G |
| Students build assignment models. | 12, 13, 14, 6, 8, 9 | A, E |
| Students build network models using appropriate algorithms. | 12, 13, 14, 6, 8, 9 | E, G |
| Students solve integer programming models using appropriate algorithms | 12, 13, 14, 19, 6, 8, 9 | A, E, G |
| Students solve mathematical models using mathematical programming software. | 12, 13, 14, 16, 6, 8, 9 | A, E, G |
| Teaching Methods: | 12: Problem Solving Method, 13: Case Study Method, 14: Self Study Method, 16: Question - Answer Technique, 19: Brainstorming Technique, 6: Experiential Learning, 8: Flipped Classroom Learning, 9: Lecture Method |
| Assessment Methods: | A: Traditional Written Exam, E: Homework, G: Quiz |
Course Outline
| Order | Subjects | Preliminary Work |
|---|---|---|
| 1 | A review of basic LP and introduction to Network Models | |
| 2 | Transportation and transshipment models | |
| 3 | Assignment models | |
| 4 | Spanning tree Problems-Prim’s algorithm, Kruskal’s algorithm | |
| 5 | Shortest Path Problems | |
| 6 | Maximum Flow Problems Ford-Fulkerson Algorithm, | |
| 7 | Multicommondity Flow, and network synthesis problems | |
| 8 | Introduction to Integer Programming | |
| 9 | Formulating Integer Programming Problems | |
| 10 | Formulating (Mixed) Integer Programming Problems | |
| 11 | Solving Integer Programming Problems- branch and bound method and cutting plane algorithm | |
| 12 | Dynamic Programming-1 | |
| 13 | Dynamic programming -2 | |
| 14 | Review |
| Resources |
| Taha, Hamdy A., Operations Research, 8th edition, 2007. ISBN: 0131360140; Bazaraa M.S., Jarvis J.J., Sherali H.D., Linear Programming and Network Flows, 3 th Edition, ISBN 978-0-470-46272-0 |
| Ahuja R.K., Magnanti T.L., Orlin B.J.; Network Flows Theory, Algorithms, and Applications, Prentice Hall. ISBN-13: 978-0136175490 Winston, Wayne L., Operations Research: Applications and Algorithms, 4th edition, 2003. ISBN-13: 978-0534380588 |
Course Contribution to Program Qualifications
| Course Contribution to Program Qualifications | |||||||
| No | Program Qualification | Contribution Level | |||||
| 1 | 2 | 3 | 4 | 5 | |||
| 1 | Adequate knowledge in mathematics, science and engineering subjects pertaining to the relevant discipline; ability to use theoretical and applied knowledge in these areas in the solution of complex engineering problems. | X | |||||
| 2 | Ability to formulate, and solve complex engineering problems; ability to select and apply proper analysis and modeling methods for this purpose. | X | |||||
| 3 | Ability to design a complex system, process, device or product under realistic constraints and conditions, in such a way as to meet the desired result; ability to apply modern design methods for this purpose. | X | |||||
| 4 | Ability to select and use modern techniques and tools needed for analyzing and solving complex problems encountered in engineering practice; ability to employ information technologies effectively. | X | |||||
| 5 | Ability to design and conduct experiments, gather data, analyze and interpret results for investigating complex engineering problems or discipline specific research questions. | X | |||||
| 6 | Ability to work efficiently in intra-disciplinary and multi-disciplinary teams; ability to work individually. | X | |||||
| 7 | Ability to communicate effectively, both orally and in writing; knowledge of a minimum of one foreign language; ability to write effective reports and comprehend written reports, prepare design and production reports, make effective presentations, and give and receive clear and intelligible instructions. | X | |||||
| 8 | Awareness of the need for lifelong learning; ability to access information, to follow developments in science and technology, and to continue to educate him/herself. | X | |||||
| 9 | Knowledge on behavior according ethical principles, professional and ethical responsibility and standards used in engineering practices. | X | |||||
| 10 | Knowledge about business life practices such as project management, risk management, and change management; awareness in entrepreneurship, innovation; knowledge about sustainable development. | X | |||||
| 11 | Knowledge about the global and social effects of engineering practices on health, environment, and safety, and contemporary issues of the century reflected into the field of engineering; awareness of the legal consequences of engineering solutions. | X | |||||
Assessment Methods
| Contribution Level | Absolute Evaluation | |
| Rate of Midterm Exam to Success | 30 | |
| Rate of Final Exam to Success | 70 | |
| Total | 100 | |