Question

Activity scheduling problem from the greedy algorithm class: Suppose that different activities earn different amounts of revenue. In addition to their start and finish times si and fi, each activity ai has revenue ri, and our objective is now to maximize the total revenue:

Answer 1

∑
`r_(i)` ∈A
`a_(i)`

Step-by-step explanation:

The goal of every business is to maximize profit. The revenue is maximized when cost of business is minimized. The different activities will incur different cost and has different start and end time of the process, the best option to maximize the revenue is the sum of activity revenue.