Optimal Allocation of Study Days to Maximize CGPA | Dynamic Programming Example
Автор: Engineering & Science Academy
Загружено: 2026-03-10
Просмотров: 20
Описание:
In this video, we solve a practical *Dynamic Programming problem from Operations Research* involving the optimal allocation of limited study days among three subjects.
A student has **7 days to prepare for three subjects: Operations Research (OR), Production Management (PM), and Quantitative Methods (QM)**. The goal is to determine how many days should be allocated to each subject in order to **maximize the total expected grade points (CGPA)**.
The problem is solved step-by-step using the **Dynamic Programming approach**, where each subject is treated as a stage and study days are allocated based on recursive optimization.
Topics covered in this video:
• Dynamic Programming concept
• State variable and decision variable
• Multi-stage decision process
• Recursive formulation
• Construction of DP tables
• Optimal allocation of study days
• Multiple optimal solutions
This example is very useful for students studying **Operations Research, Industrial Engineering, Management Sciences, Mathematics, and Optimization**.
Channel: *Engineering and Science Academy*
Subscribe for more videos on:
• Operations Research
• Engineering Mathematics
• Statistics and Optimization
• Mathematical Modeling
• Engineering Concepts
Повторяем попытку...
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке:
