Courses
Optimization Methods
A postgraduate course in computer science
AI generated by Nikhil Kumar Rajput
45 chapters
Contents¶
Front matter
- About this book
Master Lesson Plan
- How to Use This Plan
- Unit-Wise Distribution
- Unit I — Linear Programming, Transportation and Assignment (10 hours)
- Unit II — Game Theory, Sequencing, Integer Programming and Networks (10 hours)
- Unit III — Queuing Theory and Inventory Control (15 hours)
- Unit IV — Search Methods and Non-Linear Programming (10 hours)
- Mapping of Lessons to Course Learning Outcomes
- Mapping of Lectures to Practicals
- Suggested Evaluation Scheme
- Interactive Support
Unit I
Lesson 10: The Assignment Problem and the Travelling Salesman Problem
Unit II
Lesson 19: Network Scheduling: The Critical Path Method (CPM)
Unit III
Lesson 28: Models IV and V: (M/M/c):(N/FCFS) and Finite-Source Queues
Unit IV
About this book¶
The course aims to impart comprehensive knowledge about operations research and optimization techniques. Its objectives are to help students understand the fundamental concepts of operations research, to discuss and analyze the need for various optimization techniques, to design and develop appropriate mathematical models, and to formulate and optimize real-world problems using these models.