Dynamic Programming 11
Dynamic Programming11Dynamic Programming is an optimization approach that transforms a complex problem into a sequence ofsimpler problems; its essential characteristic is the multistage nature of the optimization procedure. More sothan the optimization techniques described previously, Dynamic Programming provides a general frameworkfor analyzing many problem types. Within this framework a variety of optimization techniques can beemployed to solve particular aspects of a more general formulation. Usually creativity is required beforewe can recognize that a particular problem can be cast effectively as a Dynamic program; and often subtleinsights are necessary to restructure the formulation so that it can be solved begin by providing a general insight into the Dynamic Programming approach by treating a simpleexample in some detail.
lots for a group of commuters in a model city. The arcs correspond to streets and the nodes correspond to intersections. The network has been designed in a diamond pattern so that every commuter must traverse five streets in driving from home to downtown. The design characteristics and traffic pattern are such that the total
Download Dynamic Programming 11
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: