Scribd
Upload
32 views1 page

The Principle of Optimality - An Optimal Sequence of Decisions Is Obtained Iff Each Subsequence

Uploaded by

StivenManriquePerdomo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
32 views1 page

The Principle of Optimality - An Optimal Sequence of Decisions Is Obtained Iff Each Subsequence

Uploaded by

StivenManriquePerdomo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

General working methodology for achieving solution using this approach is given as:

i. Divide into Subproblems – The main problem is divided into a number of smaller, similar subproblems. The
solution to main problem is expressed in terms of the solution for the smaller subproblems. Stage wise solutions
start with the smallest subproblems.

ii. Construction of Table for Storage - The underlying idea of dynamic programming is to avoid calculating the
same stuff twice and usually a table of known results of subproblems is constructed for the purpose. Dynamic
programming thus takes advantage of the duplication and arranges to solve each subproblem only once, saving the
solution in table for later use.

iii. Combining using Bottom-up means - Combining solutions of smallest subproblems obtain the solutions to
subproblems of increasing size. The process is continued until we arrive at the solution of the original problem.

Dynamic programming involves selection of optimal decision rules that optimizes a certain performance criterion:

i. The Principle of Optimality – An optimal sequence of decisions is obtained iff each subsequence
must be optimal. That means if the initial state and decisions are optimal then the remaining decisions
must constitute an optimal sequence w.r.t the state resulting from the first decision. Combinatorial
problems may have this property but may exploit too much memory and/or time towards efficiency.

ii. ii. Polynomial Break up - The original problem is divided into several subproblems. The division is
done in such a way that the total number of subproblems to be solved should be a polynomial or
almost a polynomial number. This is done for efficient performance of dynamic programming.

You might also like