{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Chapter 18 Part 1 - Agenda for This Week Monday April 18...

Info icon This preview shows pages 1–6. Sign up to view the full content.

View Full Document Right Arrow Icon
Agenda for This Week Monday, April 18 Dynamic Programming Wednesday, April 20 Dynamic Programming Case 3 Due Friday, April 22 Dynamic Programming Monday, April 25 AHP
Image of page 1

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Chapter 18 Dynamic Programming – Part 1
Image of page 2
Dynamic Programming Dynamic Programming (DP) is a model that deals with decisions where several decisions need to be made in sequence usually over time; called dynamic , multistage or sequential decision problems Also useful for decomposing multi-variable, single-time problems into several single- variable problems at different times
Image of page 3

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Dynamic Programming DP is a broad problem structure rather than a specific method The essential characteristic is that there is a series of decisions distributed in time, where there is an interrelationship between decisions; thus, the current decision cannot be made independently of future ones.
Image of page 4
Dynamic Programming Concepts Stages: each point in the problem where a decision must be made (can be actual or artificial points in time States:
Image of page 5

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Image of page 6
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}