Scribd
Upload
3 views3 pages

Dynamic Programming - Introdution

Dynamic Programming is a mathematical technique for optimizing a sequence of inter-related decisions over time, developed by Richard Bellman. It involves breaking complex problems into sub-problems, with decisions made at each stage that affect the state of the system. This methodology is applicable in various fields such as inventory control, network analysis, and job-shop scheduling.

Uploaded by

a c s Kumar
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
3 views3 pages

Dynamic Programming - Introdution

Dynamic Programming is a mathematical technique for optimizing a sequence of inter-related decisions over time, developed by Richard Bellman. It involves breaking complex problems into sub-problems, with decisions made at each stage that affect the state of the system. This methodology is applicable in various fields such as inventory control, network analysis, and job-shop scheduling.

Uploaded by

a c s Kumar
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/ 3

DYNAMIC PROGRAMMING

Usually, in situations, where a series of consecutive decisions are


involved, the OVERALL OPTIMAL POLICY is arrived at by considering
the effects of each decision SEPERATELY.
e.g., In Inventory Models A Policy of determining the Optimal
Inventory for each month which minimizes the Inventory
Cost for that month, may be optimal for the whole year
also, i.e., That Policy might minimize the Inventory Cost for
the whole year also.
However, in many situations, it is not necessary that:
The Overall Return for the total period (e.g., the whole year) will be
optimal If we optimize the return over each individual period (e.g., a
month)
i.e. It may be that a bit of sacrifice in one period, ( say, January’s )
might increase the return in February to a larger extent.
For such situations Optimization -- by -- Dynamic Programming
developed by RICHARD BELLMAN & Associates at the Rand Corporation,
USA might be quite useful.
Definition : A mathematical technique of optimizing a sequence of
inter-related decisions over a period of time.
The word Dynamic indicates that TIME is explicitly being considered
in this methodology.
Dynamic Programming uses The Principle of Recursion.
Here To solve a Complex problem The problem is broken into
a series of SUB- PROBLEMS.
Dynamic Programming can be applied in various situations pertaining to:
Inventory Control, Network Analysis, Job-shop
Scheduling (Sequencing), Production Control, and
Capital Budgeting, etc.,
*Some Important Terms:
1. STAGE:
Dynamic Programming problem can be divided into a Sequence of
(which are called Stages of the Original problem) Sub Problems

At each stage a Decision is made.


Usually the Stages represent Different time periods in the
Overall Period of the problem
Or
Different places (Zones) in the Overall Territory considered in the original
problem.
e.g., In Replacement problems each year may be considered a
Stage.
In Salesman problems each zone may be treated as a Stage.
2. STATE:
Each Stage has certain Number of States associated with it.
The States represent various conditions prevailing at a point in time,
( i.e., in a Stage ) of the problem.
e.g., A specific city is referred to as a State Variable in the
Shortest Route problem.
The number of States may be Finite or Infinite.
3. DECISION:
At each stage a Decision is made which affects the State of the
System at the next Stage.
Always, a Decision is made at the current stage to arrive at the
Optimal Solution at the current stage.
Every Decision has its own MERIT in terms of the Worth or Benefit

associated with it
which may be described in Algebraic form by an Equation.
called the Return Function
which depends upon the State Variable -- and -- the Decision made at
a particular Stage.
*Basic Features (Characteristics) of Dynamic Programming Problems:
1. The problem can be divided into Stages with a policy decision
required at each stage.
2. Each stage has a number of States associated with it -- and --
Various possible conditions of existence of the system at that stage of
the problem are possible.
Further, The number of States may be Finite / Infinite.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy