QUESTION
(a) Briefly describe the steps involved in Network Simplex Method.
(b) In Radix Heap Algorithm, the technique of buckets is employed. However this idea is an extension of Dial's Algorithm. Analyse the complexity of Radix Heap Algorithm referring to:
1. Movement of nodes between buckets
2. Node Selection principle
(c) Give mathematical models for the 0-1 knapsack problem and the bounded knapsack problem in Dynamic Programming.