1. Introduction to D.P D.P : Method of finding optimal solution as a sequence of decisions.

Slides:



Advertisements
Similar presentations
Dynamic Decision Processes
Advertisements

CS223 Advanced Data Structures and Algorithms 1 Greedy Algorithms Neil Tang 4/8/2010.
Dynamic Programming In this handout A shortest path example
1 Inventory Control for Systems with Multiple Echelons.
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
Deterministic Dynamic Programming.  Dynamic programming is a widely-used mathematical technique for solving problems that can be divided into stages.
The Simplex Method: Standard Maximization Problems
Optimal Stopping -Amit Goyal 27 th Feb 2007 TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.:
MIT and James Orlin © Dynamic Programming 2 –Review –More examples.
Analysis of Supply Contracts with Total Minimum Commitment Yehuda Bassok and Ravi Anupindi presented by Zeynep YILDIZ.
Transportation Models Transportation problem is about distribution of goods and services from several supply locations to several demand locations. Transportation.
> >
Dynamic Programming -Solutions (a) Dynamic programming requires that future decisions depend only on optimal ways to reach prior states. This will.
Chapter 10 Dynamic Programming. 2 Agenda for This Week Dynamic Programming –Definition –Recursive Nature of Computations in DP –Forward and Backward Recursion.
NetworkModel-1 Network Optimization Models. NetworkModel-2 Network Terminology A network consists of a set of nodes and arcs. The arcs may have some flow.
Transportation Model (Powerco) Send electric power from power plants to cities where power is needed at minimum cost Transportation between supply and.
4.1 Using Matrices to Represent Data
A Dynamic Messenger Problem Jan Fábry University of Economics Prague
Design and Analysis of Algorithms Lecture Dynamic programming Alexander Kolesnikov DEPARTMENT OF COMPUTER SCIENCE UNIVERSITY OF JOENSUU JOENSUU,
Chapter 6: Basic Option Strategies
ECES 741: Stochastic Decision & Control Processes – Chapter 1: The DP Algorithm 1 Chapter 1: The DP Algorithm To do:  sequential decision-making  state.
Wireless Sensor Networks COE 499 Energy Aware Routing
Dynamic Programming Key characteristic of a Dynamic Program: Breaking up a large, unwieldy problem into a series of smaller, more tractable problems. Shortest.
Markov Decision Processes1 Definitions; Stationary policies; Value improvement algorithm, Policy improvement algorithm, and linear programming for discounted.
ECES 741: Stochastic Decision & Control Processes – Chapter 1: The DP Algorithm 31 Alternative System Description If all w k are given initially as Then,
1 1 Slide © 2000 South-Western College Publishing/ITP Slides Prepared by JOHN LOUCKS.
MODELING AND ANALYSIS OF MANUFACTURING SYSTEMS Session 12 MACHINE SETUP AND OPERATION SEQUENCING E. Gutierrez-Miravete Spring 2001.
Algorithm Paradigms High Level Approach To solving a Class of Problems.
Costs. What are costs? Costs are amounts that a business incurs in order to make goods and/or provide services.
Converting NFAs to DFAs How a Syntax Analyser is constructed.
LINEAR PROGRAMMING APPLICATIONS IN MARKETING, FINANCE, AND OPERATIONS MANAGEMENT (2/3) Chapter 4 MANGT 521 (B): Quantitative Management.
L. Bertazzi, B. Golden, and X. Wang Route 2014 Denmark June
Two Discrete Optimization Problems Problem: The Transportation Problem.
Dynamic Programming Discrete time frame Multi-stage decision problem Solves backwards.
D Nagesh Kumar, IIScOptimization Methods: M6L5 1 Dynamic Programming Applications Capacity Expansion.
1 Inventory Control with Time-Varying Demand. 2  Week 1Introduction to Production Planning and Inventory Control  Week 2Inventory Control – Deterministic.
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
FLOAT MY BOAT. Introduction  Do you have chores or a job?  What kind of responsibilities do you have?  How do you communicate with your co-workers.
Example 1: The Absolute Value Function
Time Remaining 20:00.
Cross Hedging R. Srinivasan. Question 1 It is 20 th June, and a Pension fund wishes to hedge Rs. 1 mn stock. The hedge period is of 5 months. Portfolio.
Introduction and Preliminaries D Nagesh Kumar, IISc Water Resources Planning and Management: M4L1 Dynamic Programming and Applications.
Dynamic Programming (optimization problem) CS3024 Lecture 10.
ENGM 631 Maximum Flow Solutions. Maximum Flow Models (Flow, Capacity) (0,3) (2,2) (5,7) (0,8) (3,6) (6,8) (3,3) (4,4) (4,10)
EMGT 5412 Operations Management Science Nonlinear Programming: Introduction Dincer Konur Engineering Management and Systems Engineering 1.
1 Job Shop Scheduling. 2 Job shop environment: m machines, n jobs objective function Each job follows a predetermined route Routes are not necessarily.
CMMI for Services, Version 1.3
Dynamic Programming - DP December 18, 2014 Operation Research -RG 753.
Operating Budgets Manufacturing Budgets
Operating Budgets: Manufacturing Budgets
Dynamic Pickup and Delivery with Transfers
Rough-Cut Capacity Planning in SCM Theories & Concepts
Introduction to Linear Programs
Water Resources Planning and Management Daene McKinney
Manual Dialing Solution to Minimize TCPA Risk
BACK SOLUTION:
Genetic Algorithm: Application to Portfolio Optimization
Maximum Flow Solutions
Chapter 3 Dynamic Programming.
GEOP 4355 Distribution Problems
10:00.
Dynamic Programming and Applications
Cutting Stock Problem Problem of cutting an unlimited number of pieces of material (paper rolls, for instance) of length l to produce ni pieces of length.
April May April May June July July June August Sept August
Operating Budgets Manufacturing Budgets
Example Exercise 1 Cost Behavior Variable Costs

COMPSCI 330 Design and Analysis of Algorithms
Chapter 1. Formulations.
Stock Market Stage Analysis.
Presentation transcript:

1. Introduction to D.P D.P : Method of finding optimal solution as a sequence of decisions

Ex.1) Routing problem

Ex.2 ) Production planning How many boats should be build in what month to minimize the costs? Orders for delivery at the end of months : Mar.Apr.MayJun.Jul.Aug Construction capacity of boat build up : 4 boats in any month Hold up capacity in stock : 3 boats Overhead cost per month with/without boat build up : 4,000$/ 0$ Construction cost : 10,000$ per boat Stock holding cost : 1,000$ per boat per month In D.P terms, let n : the number of months or stages which remain until the planning horizon, that is, the end of August, is reached. state (n,I ) : the number of boats, i, which are in stock at the start of month corresponding to stage n. For example, (3,2 ) corresponds to two boats in stock at the beginning of June. action k at a given state : build k boats in the current month. r = r(I,k) : the return in any month, that is, the cost incurred in that month.