Question: Time management is often a difficult task. Usually Tim studies m hours per week. In this term, he has n courses and course i

Time management is often a difficult task. Usually Tim studies m hours per week. In this term, he has n 

Time management is often a difficult task. Usually Tim studies m hours per week. In this term, he has n courses and course i {1,...,n} requires at minimum ki hours (e.g. going to classes, discussions). Assume there is a family of linear functions f(x) = aix+b; with ai [0, ) and b; ER, which estimate the expected score of the course i if Tim studies & hours per week for that course. How can Tim allocate his time per week so that he can achieve the maximum expected average score of the whole term? Write a linear program that solves this problem.

Step by Step Solution

3.38 Rating (160 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

To solve Tims problem of allocating time each week to achieve the maximum expected average score for ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Algorithms Questions!