Question: In a rod cutting problem, given a table of prices p, the objective is to determine the maximum revenue r, obtainable by cutting up

In a rod cutting problem, given a table of prices p, the objective is to determine the maximum revenue r,  

In a rod cutting problem, given a table of prices p, the objective is to determine the maximum revenue r, obtainable by cutting up the given rod (of length n) and selling the pieces. The rod cutting problem exhibits optimal substructure property. The following table shows the price table for one particular situation: Length 1 i Price/ 1 Pi 2 . 5 3 8 4 9 5 10 6 17 7 17 8 20 a) Suppose you have been asked to find r. Use greedy algorithm to determiner Explain whether the greedy approach were able to find the optimal solution.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

Greedy Algorithm to Solve the RodCutting Problem The greedy algorithm for the rodcutting problem works as follows Start with the rod of lengthn Cut of... 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!

Related Book