Oladapo Kayode Abiodun

Course Title: Optimization Techniques

Course Code: PDC 706

Course Unit: 3 Credits

Introduction

This is a three-credit unit course offered by the post graduate diploma students of the degree programme in Computer Science. In this course content you will find useful details about this course, its aims and objectives, what the course is all about, course materials to be used, available services in support of this course, and details on assignments and examinations. You should check regularly for updates. I wish you all the best in your learning and completing this course.

Course Aim

This course introduces students to various optimization techniques used in decision-making and operations research. Students will explore mathematical models and method t o find the best possible solutions complex problems involving limited resources. The course covers linear programming, transportation problems, network analysis, game theory, queuing theory, project scheduling, and inventory control models.

Course Outline

• Introduction to optimization
• Linear Programming
• Transporation Problems
• Network Analysis
• Game Theory and Strategies
• Queuing Theory
• Project Scheduling
• Inventory Programming

Course Objectives

After completing the course successfully, the student should be able to:

1. Formulate and solve linear and non-linear optimization problems.
2. Analyze and solve transportation and assignment problems.
3. Apply network analysis tools to real-world projects.
4. Understand the principles of game theory and apply them in strategic decision-making.
5. Model and analyze queuing systems.
6. Schedule and manage projects effectively.
7. Design and implement effective inventory control systems.
8. Conduct and carry out a research paper about the course.

Assessment

• Class Attendance, Participation and Discussion: 5 marks
• Course Research Paper: 25 marks
• Mid-Semester: 10 marks
• Final: 60 marks

Information about the instructor

• Instructor: Kayode Oladapo
• Education: Ph. D. in Computer Science
• Email: oladapoka@mcu.edu.ng

Main Course

• Week 1: Introductory Class
• Week 2: Introduction to Optimization
• Week 3 - 4: Linear Programming
• Week 5 - 6: Transporation Problems
• Week 7: Course Research Paper / Mid Semester Test
• Week 8- 9: Network Analysis
• Week 10 – 11: Game theory and Strategies
• Week 12 – 13: Queuing Theory
• Week 14 - 15: Project Scheduling
• Week 16 -17: Inventory Programming
• Week 18 - 19: Revision and Examination

Week 1: Introductory Class

• Course Link and Introduction
• Course Outline
• Discussion
• Reading Materials

Week 2: Introduction to Optimization

• Definition of Optimization
• Importance of Optimization
• Types of Optimization Problems
• Applications of Optimization Exercise: Check the Learning Management System for the Week 2 Assigment
• Week Two Slide
  • Introduction

Week 3 - 4: Linear Programming

• What is Linear Programming
• Assumptions and Formulation of Linear Programming
• Graphical Method
• Simplex Method
• Duality in Linear Programming
• Sensitivity Analysis Exercise: Check the Learning Management System for the Week 3 - 4 Assigment
• Week 3-4 Slide
  • Linear Programming

    Week 5 - 6: Transporation Problems

Week 7: Course Research Paper / Mid Semester Test

Week 8- 9: Network Analysis

Week 10 – 11: Game theory and Strategies

Week 12 – 13: Queuing Theory

Week 14 - 15: Project Scheduling

Week 16 -17: Inventory Programming

Week 18 - 19: Revision and Examination