Dynamic programming is a method for solving complex problems by breaking them down into simpler sub problems. First solve sub problems and then combine all solved sub problems and make decision on that sub problems. At the end combine all sub problems.
Dynamic Programming: Learning Objective of the Article: Define and explain the term “dynamic programming”. In which situation it is used to optimize the the use of resources. Definition and Explanation of Dynamic Programming: Dynamic programming is an extension of the basic linear programming technique
Linear Programming Technique : After studying this chapter you should be able to: Definition and Explanation: Linear programming is a mathematical technique which permits determination of the best use of available resources. It is a valuable aid to management because it provides a systematic