Question
Dynamic programming
Answer :
Word Count : 243
______ ________ ______ __________ ________ ________ _____ _________ ____ ______ ___.
______ _______ ________ ________ ____ ______ ________.
______ ____ _______ ______ ________ ____ _________ _________ _____ __________ ___ ________.
_____ ____ ___ _________ ______ ________ _____.
____ ___ ________ _________ ____ ___ ________ _______ ___ __________.
_______ _________ _________ __________ ________ ________ ___ ___ _______ _______ ________.
________ ____ _________ ______ ___ _________ ________ ________ __________.
________ ___ ________ _________ ________.
___ ____ _________ _______ _________ ______ ________ _________ ___ ___ ________ ______.
__________ _____ __________ ________ ___ _________ ________ _____ __________ __________ ____.
______ ____ ___ __________ __________ ______ _______ _______ ____ __________ ____ ________.
________ __________ ________ ___ ___.
__________ __________ _____ _________ ____ _______ ________ ___.
_________ _________ ________ ________ ________ __________ ______ _______ ___ ___.
_________ _________ __________ _________ _____ _______ _______ ___ _________.
_________ ___ _______ ______ ____ _________ ______.
Skip in 10
Dynamic programming: Dynamic programming is a mathematical technique of optimisation using multistage decision process. That is, the process in which a sequence of interrelated decisions has to be made. It provides a systematic procedure for determining the combination of decisions which maximise overall effectiveness. Classical mathematics has provided inadequate in handling many optimisation problems that involve large number of decision variables and /or large number of inequality constraints. Such type of problems is handled by the dynamic programming technique. The dynamic programming technique decomposes the original problem in ‘n’ variables in to ‘n’ sub problems (stages) each
______ _______ ________ ________ ____ ______ ________.
______ ____ _______ ______ ________ ____ _________ _________ _____ __________ ___ ________.
_____ ____ ___ _________ ______ ________ _____.
____ ___ ________ _________ ____ ___ ________ _______ ___ __________.
_______ _________ _________ __________ ________ ________ ___ ___ _______ _______ ________.
________ ____ _________ ______ ___ _________ ________ ________ __________.
________ ___ ________ _________ ________.
___ ____ _________ _______ _________ ______ ________ _________ ___ ___ ________ ______.
__________ _____ __________ ________ ___ _________ ________ _____ __________ __________ ____.
______ ____ ___ __________ __________ ______ _______ _______ ____ __________ ____ ________.
________ __________ ________ ___ ___.
__________ __________ _____ _________ ____ _______ ________ ___.
_________ _________ ________ ________ ________ __________ ______ _______ ___ ___.
_________ _________ __________ _________ _____ _______ _______ ___ _________.
_________ ___ _______ ______ ____ _________ ______.
IGNOU ACADEMY
Your IGNOU journey, made easier.
- Solved Assignments
- Study Notes
- Guess Papers
- Question Papers
Continue Reading — It's Free
Sign in with Google to unlock more of this answer.
✓ Free access
✓ Unlock up to 60% of the answer
✓ No payment required
✓ Unlock up to 60% of the answer
✓ No payment required
Quick Google sign-in. No separate registration form.