Academic Journals Database
Disseminating quality controlled scientific knowledge

DYNAMIC PROGRAMMING – ITS PRINCIPLES, APPLICATIONS, STRENGTHS, AND LIMITATIONS

ADD TO MY LIST
 
Author(s): BISWAJIT BHOWMIK

Journal: International Journal of Engineering Science and Technology
ISSN 0975-5462

Volume: 2;
Issue: 9;
Start page: 4822;
Date: 2010;
VIEW PDF   PDF DOWNLOAD PDF   Download PDF Original page

Keywords: Principle of Optimality | Polynomial Break up | Subproblem | programming | Divide and Conquer | NP-hard.

ABSTRACT
The massive increase in computation power over the last few decades has substantially enhanced our ability to solve complex problems with their performance evaluations in diverse areas of science and engineering. With the recent developments in the field of optimizations, these methods are now become lucrative to make decisions. Dynamic Programming is one of the elegant algorithm design standards and is powerful tool which yields classic algorithms for a variety of combinatorial optimization problems. In this paper fundamental working principles, major area of applications of this approach has been introduced. The strengths which make it more prevailing than the others is also opened up. Focusing the imperative drawbacks afterward comparison study of this algorithm design technique in this paper brings a general awareness to the implementation strategies.
Why do you need a reservation system?      Save time & money - Smart Internet Solutions